Search engine optimizer

ABSTRACT

A search engine optimizer, which works independently and in parallel with a browser and search engine supercomputer to gather, analyze, and distill input information interactively. The optimizer reorganizes the input, and providing an optimized version as an output. The optimized version of the input (e.g. output) is sent to the search engine, which responds to the end user with search results. The optimizer recognizes each request as a pattern and stores the pattern in an advanced Glyph format. This permits the optimizer to identify a left and ride side check mate combination required to achieve certitude.

CROSS REFERENCE TO RELATED APPLICATIONS

This Divisional Patent application claims the benefit of:

co-pending U.S. patent application Ser. No. 15/829,963 filed on Dec. 3, 2017,

wherein U.S. patent application Ser. No. 15/829,963 is a Divisional Application claiming priority to co-pending U.S. patent application Ser. No. 15/829,916 filed on Dec. 2, 2017,

wherein U.S. patent application Ser. No. 15/829,916 is a Divisional Application claiming priority to co-pending U.S. patent application Ser. No. 15/708,122 filed on Sep. 18, 2017,

wherein U.S. patent application Ser. No. 15/708,122 is a Divisional Application claiming priority to co-pending U.S. patent application Ser. No. 15/644,713 filed on Jul. 7, 2017,

wherein U.S. patent application Ser. No. 15/644,713 is a Divisional Application claiming priority to co-pending U.S. patent application Ser. No. 15/494,497 filed on Apr. 22, 2017,

wherein U.S. patent application Ser. No. 15/494,497 is a Continuation-in-part claiming priority to co-pending U.S. patent application Ser. No. 15/486,276 filed on Apr. 12, 2017,

wherein U.S. patent application Ser. No. 15/486,276 is a Continuation-in-part claiming priority to co-pending U.S. patent application Ser. No. 15/390,713 filed on Dec. 26, 2016,

wherein U.S. patent application Ser. No. 15/390,713 is a Divisional Application claiming priority to co-pending U.S. patent application Ser. No. 15/352,555 filed on Nov. 15, 2016,

wherein U.S. patent application Ser. No. 15/352,555 is a Divisional Application claiming priority to co-pending U.S. patent application Ser. No. 15/264,996 filed on Sep. 14, 2016,

wherein U.S. patent application Ser. No. 15/264,996 is a Divisional Application claiming priority to co-pending U.S. patent application Ser. No. 15/246,446 filed on Aug. 24, 2016,

wherein U.S. patent application Ser. No. 15/246,446 is a Divisional Application claiming priority to co-pending U.S. patent application Ser. No. 15/175,861 filed on Jun. 7, 2016,

wherein U.S. patent application Ser. No. 15/175,861 is a Divisional Application claiming priority to co-pending U.S. patent application Ser. No. 14/682,052 filed on Apr. 8, 2015,

wherein U.S. patent application Ser. No. 14/682,052 is a Divisional Application claiming priority to co-pending U.S. patent application Ser. No. 14/623,559 filed on Feb. 17, 2015,

wherein U.S. patent application Ser. No. 14/623,559 is a Divisional Application claiming priority to co-pending U.S. patent application Ser. No. 14/582,236 filed on Dec. 24, 2014,

wherein U.S. patent application Ser. No. 14/582,236 is a Divisional Application claiming priority to U.S. patent application Ser. No. 14/578,439 filed on Dec. 21, 2014,

wherein U.S. patent application Ser. No. 14/578,439 is a Divisional Application claiming priority to U.S. patent application Ser. No. 14/474,268 filed on Sep. 1, 2014,

wherein U.S. patent application Ser. No. 14/474,268 is a Divisional Application claiming priority to U.S. patent application Ser. No. 14/028,508 filed on Sep. 16, 2013 (issued as U.S. Pat. No. 9,355,352 on May 31, 2016),

wherein U.S. patent application Ser. No. 14/028,508 is a Continuation-In-Part Utility Application claiming priority to co-pending U.S. patent application Ser. No. 14/013,018 filed on Aug. 28, 2013 (now abandoned),

wherein U.S. patent application Ser. No. 14/013,018 is a Continuation-In-Part claiming priority to co-pending U.S. patent application Ser. No. 13/777,775 filed on Feb. 26, 2013 (issued as U.S. Pat. No. 8,977,621 on Mar. 10, 2015),

wherein U.S. patent application Ser. No. 13/777,775 is a Continuation-In-Part claiming priority to co-pending U.S. patent application Ser. No. 13/247,964 filed on Sep. 28, 2011 (issued as U.S. Pat. No. 8,868,535 on Oct. 21, 2014),

wherein U.S. patent application Ser. No. 13/247,964 is a Continuation-In-Part claiming priority to co-pending U.S. patent application Ser. No. 12/785,122, filed on May 21, 2010 (issued as U.S. Pat. No. 8,386,456 on Feb. 26, 2013),

wherein U.S. patent application Ser. No. 12/785,122 is a Continuation-In-Part claiming priority to co-pending U.S. patent application Ser. No. 12/778,228, filed on May 12, 2010 (issued as U.S. Pat. No. 8,239,229 on Aug. 7, 2012),

wherein U.S. patent application Ser. No. 12/778,228 claims the benefit of each of the following branches:

A. wherein U.S. patent application Ser. No. 12/778,228 is a Continuation-In-Part claiming priority to co-pending U.S. patent application Ser. No. 12/764,934, filed on Apr. 21, 2010 (issued as U.S. Pat. No. 8,676,667 on Mar. 18, 2014);

B. wherein U.S. patent application Ser. No. 12/778,228 is a Continuation-In-Part claiming priority to co-pending U.S. patent application Ser. No. 12/146,420, filed on Jun. 25, 2008 (issued as U.S. Pat. No. 7,908,263 on Mar. 11, 2011);

C. all of which are incorporated herein in their entireties.

BACKGROUND OF THE INVENTION Field of the Invention

The present invention relates generally to an Internet search engine optimizer. More particularly, the present invention relates to an interface product that works independently and in parallel with the browser and search engine supercomputer that gathers, analyzes and distills input information interactively.

Background

The limitations, drawbacks and/or disadvantages of current search engines technologies are as follows:

The environment or Internet can be considered as a massive volume telecommunication network with billions of subscribers. Search engine supercomputers gather, analyze information of the environment estimated to be 30 billion unique pages for the English language, and using eigenvectors to measure large scale indices of information stored in databases to determine the most probable result pages with the end user's match criteria. As explained before U.S. Pat. No. 6,614,893 and its continuations teach as the size of the environment increases the level of redundancy and tax burden exponentially increases. For this reason it will be object of this invention to perform the following improvements:

1) Clean, standardize and organize the spaghetti of the environment by gathering, analyzing, distilling, managing, organizing and distributing the huge amount of information in a massive parallel distributed managerial hierarchical supercomputer commercial known as a Managerial Pyramid Switch™ or MPS™ that removes redundancy, latency and the organizational tax burden. The MPS™ organizational hierarchy environmental domain will be divided into three tiers: a) MPS™ nodes have global domain, b) Synergy Information Switch™ or SIS™ nodes have regional domain, and c) Team Work Switch™ or TWS™ have local domain. The global domain is divided by Continent, the regional domain by Country and the local domain into Country regions or LATA if in the USA.

2) Once the spaghetti of the environment is removed the system will be able to eliminate redundancy, increase throughput, and eliminate complexity of the exponential rate of growth associated with the size of the environment.

3) Prior art Search Engines are based on ‘Boolean Algebra’ eigenvector algorithms that are used to prorate and filter information indices until the top page ranks are determined and displayed to the end user. Furthermore, some specific keyword may be too bright and confound a search by hiding optimal results.

4) Search Engines are predominately designed to perform one request to one reply search patterns. Each search pattern is performed from the ground up and does not take into account many requests to one reply patterns consisting of consecutive related and unrelated searches the end user typed to reach the final destination while randomly surfing the environment.

5) Page ranks have serious limitation due to the Caesar's “divide and conquer” nature or ‘Boolean Algebra’ approach of deriving the top results. A system that recognizes keyword combinations and when incomplete supplies and inserts missing gaps of information The system correlates partial vectors to create a resultant vector representing a collection of top X page ranks that is certain or possesses 100% accuracy.

In a nutshell ‘Boolean Algebra’ search engine can be described as logical patterns that mimic a Watson-like criminal investigation approach to finding the best results.

BRIEF SUMMARY OF THE INVENTION

The invention is directed to an Internet search engine. The Internet search engine employs a Hive to optimize the search procedure.

The Hive

The Internet searchable environment or (U) can be construed as a complex network with billions of web pages. The Search engine supercomputer analyzes each web page, and then uses eigenvectors to determine the highest ranked pages from the end user's match criteria.

The Hive relates to a system of computers linked into a neural simulation network, the simulation network, which comprises a hive of relatively inexpensive, smaller computers, interlinked as a hierarchy and including parent and junction point simulation computers and, respectively, dedicated computers for performing specific tasks and other computers to provide processing power and still others at the peak of the command hierarchy to synchronize and delegate tasks among the various interlinked simulation computers with continuous automatic reevaluation and redirection in real time as taught in U.S. Pat. No. 6,614,893 (a parent of this application and incorporated herein by reference) for a telecom network.

Set theory by definition is the branch of mathematical logic that studies sets, which informally are collections of objects, fuzzy set theory or simply fuzzy logic to those in the field. In set theory an object is either a member of a set or not. In fuzzy set theory this condition was relaxed so an object has a degree of membership in a set, a number between 0 and 1. Algebra of set defines the properties and laws of sets is the set-theoretic analogue of the algebra of numbers just as arithmetic addition and multiplication are associative and commutative, so are set union and intersection; just as the arithmetic relation less than or equal is reflexive, anti symmetric and transitive, so is the set relation of subset. Thus U.S. Pat. No. 6,614,893 (a parent of this application and incorporated herein by reference) teaches the billing rate is estimated from the moment the call is initiated, and the accuracy of the estimate increases as the call progresses so that billing takes place in real time. This billing method is known as a fuzzy system because it takes partial data samples and continuously projects an estimated total in real time. The more data exchanged through system messages that is through chaining, the more accurate the extrapolation becomes, until it reaches one hundred percent accuracy. The interactive simulation creates a data warehouse virtual environment.

The Hive relates to a system of computers linked into a neural network which continuously scans and gathers information from, understands, and interacts with, an environment, a system of computers linked to form a neural network is disclosed, including a hive made up of a hierarchy of interlinked individual computers functioning as a unit, the hierarchy including dedicated computers which perform certain specific tasks, processing computers which provide processing power to the unified hive, and parent computers at the peak of the command hierarchy which synchronize and delegate tasks among the other interlinked computers and while providing continuous and automatic reevaluation and redirection in real time. The interlinking of the computers making up The Hive permits execution of strategies pre-set by the user and also permits user updating and changing of the strategies as new information becomes available. The synergistic interlinking of these several computers multiplies processing power to a level many magnitudes greater than that of a single computer running as taught in U.S. Pat. No. 7,058,601 (a parent of this application and incorporated herein by reference) for a generic network.

The Hive An apparatus for performing the method is also provided, including a computer hive made up of a plurality of inter-linked computer devices having specialized functions, the computers operating in unison to create a supercomputer having shared disk space and memory, in which each node belongs to the collective and possesses its own business rules and membership to an organization managerial hierarchy.

(1) a software tier in which each subscriber has its own unique club member identification which is unique to the hive.

(2) an IP tier in which multiple IP servers allocate resources to the end users to enable the end users to receive live music and to interact in a virtual environment; and

(3) a billing and control tier through which the computer hive validates requests, performs live billing, and controls of all of the interactions the subscribers receive as taught in U.S. Patent Application Ser. No. 60/193,260 (a parent of this application and incorporated herein by reference) for IP server hosts.

Virtual maestro based on U.S. patent application Ser. No. 09/819,174 (a parent of this application and incorporated herein by reference) is a product of artificial intelligence, since it would be impractical to provide a real person to process personal selections for each and every subscriber. The virtual maestro is represented by a virtual image, either of Beethoven or Mozart, in the virtual concert hall and will play specific song or video requests of an individual subscriber, on a pay per view basis. Alternatively, the maestro will select a series of songs of videos according to the profile stored for the individual subscriber. The profile is assembled from information the subscriber provides to become a subscriber and from a history of selections made by the subscriber through the system, and the profile is in effect how the particular subscriber is clothed in the virtual world. The payments by the subscriber for selections through the maestro are higher than for selections played for a mass of subscribers by the disk jockey, because the maestro selections are made for the particular individual.

The Hive added new functionalities based on U.S. patent application Ser. No. 11/085,678 (of which this application claims priority) to allow secure firewall partitions perform encrypted peer to peer (P2P) transactions as follows:

(4) A Total Quality Management (TQM) tier, also referred as Informational Portal, including means for enabling supplier regulation of public and private area privileges, and regulation of advertising delivery system content distribution. The TQM tier gathers information with regards to selection of works and merchandise purchased by each member. This information is used, in part, to customize the advertising displayed for the particular member during the purchase of merchandise, playing of specific works, and financial transactions.

(5) A Spyware tier, also referred as SNOOP, a mechanism that scans the interaction with the supplier system and interacts with the client software to help insure proper identification of the person's age and location at all times. When an end users requests to use the supplier system, SNOOP verifies that the latest version of the programs and resources are made available. This program will prohibit the access to system to those that are unlicensed.

(6) Command and Control tier, also referred as Command Center, is the brain of the system, processing the information of the environment into a lingua franca and then, based on defined business rules, sets forth criteria, resource allocation and task priorities, so that subsystems can work at maximum effectiveness and efficiency as a direct result of having a clear understanding of the environment. Upon receiving a final Billing Entity, the Command Centre distributes credits, funds, licensing and royalties, to the appropriate parties.

(7) A Security tier, also referred as Crusader Technology, defining computer software comprised of a hybrid firewall system which filters out unlicensed P2P transactions, blocks potentially pirated downloads, and interacts with a supplier system to offer a consumer the best quality, product and service, along with a comprehensive array of available shipping methods. By communicating, controlling, displaying, encrypting, managing, rendering, transferring, validating and verifying, interaction with the supplier system, Crusader Technology is able to customize, update and profile the end user by utilizing an Artificial Intelligence Point of Sale Application referred to as virtual “Customer Service Representative (CSR).

(8) An Advertising tier, also referred as Media Prophet, allows Corporations to specify distinct areas of coverage, or billing the exact territorial franchise store by ANI range, IP Address or Zip Code. Based on the end user's willingness to give information the system will negotiate the best value and then verifies that the individual has consented and has giving them the up to date credits for displaying and rendering of the advertisement they want to view. This is performed by taking into account uniqueness, demographics, and frequency or usage of advertisement with a monthly and yearly period.

(9) an Anti Malware tier, also referred as Phoenix Countermeasures, consists of an independent set of nodes that analyze the known traffic and determine patterns of behaviors to filter out copyrighted materials from the ocean of files transmitted over the Internet. This software is also responsible for killing P2P file transfers that are uploading/downloading unlicensed files. This program is responsible to modifying and updating SNOOP search patterns.

“Spaghetti of the environment” is similarly same to those in the field to spaghetti code “is a pejorative phrase for source code that has a complex and tangled control structure, especially one using many GOTO statements, exceptions, threads, or other unstructured branching constructs. “Spaghetti of the environment” is named such because program flow is conceptually like a bowl of spaghetti, i.e. twisted and tangled. Spaghetti code can be caused by several factors, such as continuous modifications by several people over a long life cycle. Structured programming greatly decreases the incidence of spaghetti code.

Removing the “spaghetti phenomena” is similarly same to those in the field to code refactoring and when applied to the Internet to finding independence independent resources after performing a normalization process that attenuates dependent and low-quality links.

UCommerce relates to a universal shopping cart as per Ser. No. 10/852,394 XCommerce, as defined in U.S. Pat. No. 7,809,659 converts the massive amounts of electronic information of the Internet by transforming the content into basic language business blocks and then stores its mathematical values into Environmental Bitmaps Data Structures, so that Inventory Control Systems can quantify, qualify and match/merge the best satisfying results of an end user KEYWORD request, whereas Codex is similarly same to those in the field as knowledge and customer satisfaction inventory control encyclopedia of human ideas.

The LATIN is similarly same to those in the field to standardize each message into a lingua franca using a Hungarian notation so that all the machines can communicate amongst themselves without having to spend resources doing translations and then using business rules create a Vector CDR that is a single version of truth taking into account costs, and exact path.

Rules of semantics to those in the field is similar to Rules of language “is typically said to be governed by a group of unspoken rules: phonological, semantic, syntactic, pragmatic, prosodic, and idiosyncratic. These rules shape the way language is written, spoken, and interpreted. People create communication, not languages, phrases, or letters.” (C) 2016 en.wikipedia.org All Rights Reserved. U.S. Pat. No. 7,809,659 in particular teaches: The process of improving the Informational Certainty begins by filtering the KEYWORD search by reading, comparing validating the semantic structure of the content of the all the responses and not just the highest page ranks. The supplier system measures the value of the content by comparing the quantity and quality of Simple Joins, Blocks, Ceiling and Walls, which are another name for collections of words and grammatical rules that are used to write properly in a given language.

Deductive Reasoning approach that is a clever and more intuitive criminal investigation means that mimics Sherlock Holmes case solving techniques. A language-based search engine optimizer must use as point of reference a lingua franca that is mathematical and simultaneously integrates a particular language, personal, geospatial, time and corporate information. Whereas Inductive Reasoning measures popularity scores to solve for a solution.

X_FOB is similarly same to those in the field, as requesting FOB pricing using a time dimension (X) expressed in days, whereas Y_CDIF offers door to door services including customs and duties for mission critical item using time dimension (Y) express in hours.

Z_PRICE to those in the field, describes the process “once the shopping cart server has performed multiple calculations the optimal solution with “the price” is displayed to the computing device” wherein The computing device can be at least one of: the end user computer terminal, computing device and or smart device, and the like.

W_RANK to those in the field teaches a search pattern that maps optimal answers to the end user. W_RANK can be static for assisted input or dynamic when simulating an end user randomly surfing the web to find the final destination. The mathematical field of topology allows the creation of dynamic pattern using set theory rules of association, transitivity, and the combining with fuzzy logic each entity is given relevancy and likelihood value.

A Cherry Picking process to those in the field can be defined by limitations taught in claim 1 of U.S. patent application Ser. No. 12/146,420, filed on Jun. 25, 2008 (issued as U.S. Pat. No. 7,908,263 on Mar. 11, 2011), which states: (A) deciphering and solving an optimal search pattern mathematical equation using deductive reasoning, (B) translating the end user's language based request into a single search pattern equation, (C) obtaining information from any given language by using math in lieu of linguistics and (D) consolidating all related and significant requests into a resultant environment that contains all of the relevant and corresponding dynamic and improved hierarchical set to create an outcome optimal hierarchical sets.

The CORE List or Codex Encyclopedia, to those in the field, can be defined by limitations taught in claim 2 of U.S. patent application Ser. No. 12/146,420, filed on Jun. 25, 2008 (issued as U.S. Pat. No. 7,908,263 on Mar. 11, 2011), which states: determining based on the quality of the keyword combination of the managerial hierarchical partition exists in the search pattern database, and thus having readily available and pre-processed the optimal response, requiring no further calculations, bypassing the usage of existing search engine capabilities.

The Hive performs the following:

(A) Transforms Data: cleans, standardizes and organizes the spaghetti of the environment by organizing the information into managerial hierarchy structure.

(B) Remove chaos and anarchy: Once the ‘spaghetti of the environment’ is eliminated creates command messages that are also known as Summary Reports that coordinate and synchronize each node to operate at maximal output capacity. Each node operates without adversely affecting the network flow of data. The Hive maximizes available throughput and limits the exponential rate of growth of complexity as the size of the environment increases.

(C) Convert Requests into Ideas: Search Engines dependency on Boolean algebra use inductive reasoning popularity scores to find the top results. In contrast, The Hive using deductive reasoning to interpret interactive input as being part of an idea being formulated by both the left and the right sides of the brain.

Boolean algebra Search Engines use eigenvector algorithms to parse and filter information indices until the top page ranks are determined and displayed as output. Each search is processed from the ground up, analyzing the searchable environment, without taking into account multiple requests belonging to one session while randomly surfing the web.

The Hive uses the optimizer software residing in a computing device memory executing instructions based on rules of grammar and semantics to transform input into a search pattern as follows:

Relative Master Indices: keeps in existence for each search pattern a relative Master Index and continuously purifies and synchronizes the plurality of relative Master Index that permits to match/merge and then correlate the Internet's Master Index in real time.

Identify new significant content: The Optimizer continuously scans and detects the Internet searchable environment for new content with significant difference quality to update each search pattern's improved environment relative Master Index and top (n) pages as output.

Dynamically Updates Output: The Optimizer rank value is dynamically adjusted by matching independent variables and related keywords belonging to the search pattern to generate a content value. The Optimizer “cherry picks” the best content value web pages as output. The output is forward chained back to the end user's terminal and displayed.

Simulates the Entire Superset of valid Search Patterns: The Optimizer is a method and system for simulating Internet browser search capacities that cleans, standardizes, organizes, and transforms the massive amount of data into a lingua franca comprising of valid keywords, term clusters, and unique geospatial patterns contained in the Internet collectively known as patterns that exist in each page. The relative Master Index for each search pattern is stored and updated as crawlers detect significant changes in the environment.

Summary as Taught by Related Applications

As taught in U.S. patent application Ser. No. 09/514,940—Issued as U.S. Pat. No. 7,058,601 (a parent of this application and incorporated herein by reference)

The Hive having a media value database that is in digital communication with The Hive that is searched to monetize and commercialize each transformed input and corresponding optimal output as follows:

Real time optimization and strategy execution system to function as a single unit, including at least one parent computer synchronizing and delegating tasks among the several computers; so that the unit scans and gathers data from the virtual environment, and processes and organizes the data into an implementable representation of the data.

Delivers the implementable representation of the data in the form of a report to a user computing device or computer terminal and awaits a decision from a human user.

Human Knowledge Entities: Continuously processes and filters raw data into primed data comprehensible for human monitoring and evaluation as a summary report object.

The computing device communicating to the Hive is in digital communication to search the Codex and a webpage database residing in the Codex that stores in memory the master index and the partial master index for each element of the Codex.

Index Refined Entities analyzes and parses through news, data and information in real time to determine portions thereof having relevance to the recently primed data received.

Personalized (Dynamic) Entities executes a set of software instructions to compare the primed data to end user-defined parameters to automatically generate output.

Proactively Identifying Significant Entities: Provides data warehousing and business intelligence analysis, should the primed data be deemed relevant.

Updating End User's Terminal: Determines the information being tracked by an end user, customizing news, data and other information based upon the particular information being tracked, and automatically updating the end user with the latest trending information.

Continuous Assessment: Performs automatic reevaluation and redirection, coordinates, controls, manages, prioritizes, and synchronizes the tasks of each subordinate node.

As taught in U.S. patent application Ser. No. 10/926,446—Issued as U.S. Pat. No. 7,050,813 (a parent of this application and incorporated herein by reference)

Partial Differential Equation Vectors Model:

The Hive creates summarized information and builds a valid vector CDR that renders remaining CDR obsolete. The Hive environmental bitmaps are summarized information of the simulation network, used to maximize throughput, redundancy is eliminated minimizing saturation. The valid Vector CDR is a multi-variant single version of the truth Vector. The simulation network environmental bitmaps is the basis for the Summary Report object.

The Hive nodes summarize information of the simulation network. The Hive nodes stores informational certain summarize information of the current conditions of simulation network that is used to remove the spaghetti phenomena by normalizing the simulation environment. Now, the Hive transfers the exact conditions and route patterns of the entire network to each node, permitting every time a call is instantiated the creation and assignment of the necessary known resources to create an exact route.

The Hive solves solutions with two or more independent variable. The solution requires an equation with a plurality of independent variables. Thus we replace the traditional vector with Partial Differential Equation Vectors using Set Theory and then solves for the independent variables (I, J, K), to create a billing entity and resultant vector. The node controlling Partial A functions (alternatively know as a subscriber) creates a final resultant vector that includes all the circuits.

As taught in U.S. patent application Ser. No. 10/852,394 (a parent of this application and incorporated herein by reference)

The Hive functions and characteristics are as follows:

Computer Network System: Consists of a plurality of artificial intelligence nodes, programmed to perform predefined tasks based on the current conditions of the environment.

CPU Nodes: are autonomous and in real time analyze, evaluate, gather and process information from the environment. From incipiency upon receiving the fuzzy logic piece of information that triggers a new or updated task.

Managerial Hierarchy: All nodes are configured into a managerial hierarchy, the Upper tiers control and coordinate and the Lower Tier constitutes the workhorse of the system.

Synergy: Every predefined cycle each node synchronizes the latest inventory. Nodes request siblings for any excess buffer resources to complete a task using vertical and lateral synergy. Parent nodes use their chain of command to coordinate their subordinates.

Eliminates the Spaghetti Phenomena: standardizes raw information into primed data so that Information Certainty is achieved and thus removes the Spaghetti Phenomena.

Primes Vector or Call Detail Records (CDR): Lingua franca messages or vectors contain the trajectory and all transactional segments information. Each assigned hierarchical owner plots the vector trajectory so that nodes can communicate amongst themselves via forward and reward chaining.

Avoids Taxing the Throughput: Upper nodes use environment bitmap information to control and coordinate the traffic in order to avoid taxing available throughput.

Maximal Throughput: Bitmap information permits each node via synergy to shares resources with other nodes with substantial buffer to eliminate the tax burden and waste.

Analyzes Network Traffic: Informational traffic is measured allowing nodes of each tier perform the non-obvious task synchronizing and managing their subordinates to use synergy to minimizing waste before permitting data to be transmitted through their chain of command.

Informational Certainty: Nodes remove waste at incipiency, so the computer network system can be considered a real time invention.

Stabilizes the Flow of Information: The managerial hierarchical stabilize the flow of information and allows nodes to use synergy to work as a single unit permitting the computer network to create a virtual instance of the organizational environment.

Real Time System: Once the spaghetti phenomena is eliminated, informational certainty is achieved. The system rearward chains the routing vector through the simulation network to the point of origin and analyzes and evaluates the best usage of network resources.

As taught in U.S. patent application Ser. No. 11/584,941—Issued as U.S. Pat. No. 7,809,659 (a parent of this application and incorporated herein by reference)

XCommerce, is a method that simulates the entire superset of potential valid interactive input regular expression requests construed during an Internet browser search and converting the results set into a vector based statistical data that enable efficient and accurate searching. Indexing searches as follows:

Managerial Hierarchical Index Relationships: a request is broken down into keywords and clusters, and then converts them into a search pattern. Keyword and clusters are also known as one or more token, certain parameters to a search and plurality of features of a resource, wherein each of the features is of a different feature type;

Determining what is Relevant and Irrelevant: Pages that match a Relationship Index are relevant, and those that do not are irrelevant.

The Internet environment is a super block that is partitioned into a managerial hierarchy. The primary index relationship creates blocks, then secondary index relationship creates sub blocks and, afterwards the tertiary index relationship creates mini blocks.

Identifies Static Search Patterns: The computer network system determines if the search pattern already exist and if yes sends the output to the end user.

Calculates Dynamic Search Patterns: The system uses managerial hierarchical relationship indices to create optimal size partitions and probabilistically determines a match. When a match occurs the Optimizer picks the top (n) pages with the highest values.

Finds New Search Patterns: Stores each new search patterns and top (n) pages.

Displays Top (n) pages: Sends and displays the output in an order to the end user.

As taught in U.S. patent application Ser. No. 13/247,964—Issued as U.S. Pat. No. 8,868,535 (a parent of this application and incorporated herein by reference)

Codex, using the benefit of U.S. patent application Ser. No. 11/584,941 filed on Oct. 23, 2006 (issued as U.S. Pat. No. 7,809,659 on Oct. 5, 2010) and U.S. patent application Ser. No. 12/764,934, filed on Apr. 21, 2010 (issued as U.S. Pat. No. 8,676,667 on Mar. 18, 2014), cleans, organizes, inventories, standardizes and mirror image of the existing Internet environment. The mirror image of the existing Internet environment is a neural network which continuously scans and gathers information from, understands, and interacts with, an environment as per U.S. patent application Ser. No. 10/603,963, filed on Jun. 25, 2003 (issued as U.S. Pat. No. 6,614,893 on Sep. 2, 2003) and U.S. patent application Ser. No. 10/603,963, filed on Jun. 25, 2003 (issued as U.S. Pat. No. 6,614,893 on Sep. 2, 2003) that is absent of the spaghetti phenomena and is organized in several layers of refinement to eliminate the exponential rate of growth the primary confounding element of the search process, and furthermore, having Vector V that is a single version of the truth that is absent of redundancy, spam and virus links. When performing said task the system correlates the content of each paragraph, and page belonging to the same site. The system primes each paragraph, and this is when confounding data is eliminated by supplying the missing gaps of information.

In U.S. patent application Ser. No. 11/584,941, filed on Oct. 23, 2006 (issued as U.S. Pat. No. 7,809,659 on Oct. 5, 2010), Rules 118, 119 and 120 teaches a neural network how make concise, precise and optimal searches after using lexical features layers of refinement for each search pattern.

U.S. patent application Ser. No. 12/146,420, filed on Jun. 25, 2008 (issued as U.S. Pat. No. 7,908,263 on Mar. 11, 2011) teaches how a neural network mimics the human brain, and performs a comparative analysis of a plurality of requests, eliminates confounding data by supplying missing gaps of information, primes the actual content of the optimal environment paragraph by paragraph to elucidate the best fitting content recommendation.

U.S. patent application Ser. No. 11/584,941 filed on Oct. 23, 2006 (issued as U.S. Pat. No. 7,809,659 on Oct. 5, 2010), U.S. patent application Ser. No. 12/146,420, filed on Jun. 25, 2008 (issued as U.S. Pat. No. 7,908,263 on Mar. 11, 2011) and '535 teach the following:

TIER 1 Join Pyramid 1,000,000,000 pages 50%-60% accuracy TIER 2 Simple Pyramid 1,000,000 pages 61%-85% accuracy TIER 3 Hybrid Pyramid 10,000 pages 86%-95% accuracy TIER 4 Complex Pyramid 100 pages 96%-99% accuracy TIER 5 Optimal Pyramid Final destination 100% accuracy

When referring to the final destination: The global, regional and local scope may differ. For example: a (local) map may be valid, the (global) home page of the company and an (global) encyclopedia definition or (regional, local) news item; nevertheless if a checkmate combination is found, the user's intent is known.

To overcome issues identified in the current art, it would be desirable to have a method that does the following:

1) Organizing the Environment: The information comprising the environment must be standardized, primed, distributed and configured as a MPS™ supercomputer. Cholti Search Engine Optimizer is the client side of the architecture and behaves in the same manner as traditional ‘Boolean Algebra’ browser that is able to identify, validate and verify interactively each end user request. Then it categorizes keywords, clusters and geospatial keywords and assigns them to left or right side of the brain. The left side of the brain consists of the hierarchical three tiers that analyze, and statistically shrinks the valid size of the environment. The right side of the brain is the secondary method of shrinking the size of the environment by assisting the left side by weighting and distilling the hierarchical set with geospatial information.

First, the software must select from the available valid keywords for a combination that does a global domain search that is referred as the Superset (i) of a request. The keywords used to create the Superset (i) must be exhausted from the request bitmap that stores with 1 and 0 each keyword. 1 denotes valid and unused, while 0 invalid or used. Second, the software must continue to select from the remainder valid keywords for a combination that does a regional domain search that is referred as the Set (i, j) of the request and is subordinate to a superior Superset (i). The keywords used to create the Set (i, j) are exhausted from the request bitmap. For each Superset (i) a plurality of Set (i, j) may exist. Third, the software must continue to select from the remainder valid keywords for a combination that does a local domain search that is referred as the Subset (i, j, k) of the request and is subordinate to a superior Set (i, j). The keywords used to create the Subset (i, j, k) are exhausted from the request bitmap. For each Set (i, j) a plurality of Subset (i, j, k) may exist. Based on the request bitmap unused keywords become essential in the process of deciphering with certitude the optimal result page.

2) Limiting the size of the environment: From the master list of keywords for a specific language in this case English the optimizer will be able to associate them to related groups. Keyword can be English language words, mixed or commercial names, scientific words, important people, geographical places such as cities or zip codes, IP Addresses and ANI or phone numbers. The MPS™ uses organizational management techniques to partition the environment into three managerial hierarchical tiers from top to bottom global, regional and local. Furthermore, each keyword belongs to an environment that may not exceed 2{circumflex over ( )}30 or 1,073,741,824 or 1 billion page results. Those page results that exceed the maximum limit are considered improbable. By prohibiting the environment size never to exceed the one 1 billion page result limit the following trend occurs: “as the size of the environment is reduced proportionally the informal entropy improves”. Performing analysis on smaller primed and valid environments permits the optimizer to eliminate the geometric rate of growth of complexity associated with the raw and unmanaged Internet. Complexity is the core catalyst of why the environment is confounded and disorganized and resembles spaghetti. The Superset (i), Set (i, j) and Subset (i, j, k) hierarchical set are designed to logically partition the raw and unmanaged environment. Cholti uses mathematical parameters to create smaller primed and valid environments that take into account that any given request in particular the last one is not optimal. The system creates Super Sites that comprise of correlating the entire content of the IP Address into a single object. Each object is assigned to a unique Quality plane to further help the optimizer to assign a search value limit. Super Sites will have a value or weight associated with each unique significant difference requests in a session.

3) Deductive Reasoning: Once the search engine optimizer creates an equation and assigns valid Hot & Cold Algorithm parameters to reduce the size of the environment. Hot Algorithm measures the end user's usage pattern for each keyword, whereas Cold Algorithm analyzes the usage patterns and the fluctuating ‘Boolean Algebra’ keyword strength to determine its irrelevancy factor.

Once the environmental boundaries are known for a request and session using the Hot & Cold parameters for each keyword or cluster Cholti has all required information to solve mathematically for the optimal solution.

Then keywords and clusters are converted into Glyph objects. Each Glyph has an exact match value that is used to measure the quality of each page. The three groups of Glyphs that are used to create the hierarchical set are Superset (i), Set (i, j) and Subset (i, j, k) have a value of 1. When a page has a value of it 1 it is denoting that it is being measured using ‘Boolean Algebra’ means. The system creates Super Pages that are objects that store a plurality of relative value a given page may have during a session. A session comprises a plurality of consecutive requests. The system optimally gathers four samples for each request as follows:

A) Ax or ‘Before’ measures the implicit ‘Boolean Algebra’ size of the environment, and serves as a point of reference to calibrate a search.

B) Bx or ‘After’ is how the optimizer reorganizes and valorizes each keyword in a request to further distill and limit the size of the environment.

C) Cx or ‘Improved’ is the process that derives the optimal environment size by using the Hot and Cold Algorithms. During this process information is match/merged and stored into the Super Sites objects. The Cx samples are relative small and range in size from 10,000 to 1,000.

D) Dx or ‘Optimal’ is the process that ‘cherry picks’ the optimal results by comparing the resulting Cx sample size against the dynamic value of each valid Glyph. During this process information from relevant pages are match/merged and stored into Super Page objects. The Dx samples are tiny and range in size from 1,000 to 100 always being ten percent of the Cx sample. The top 20 Super Pages that have the highest values based on the end user session conditions are parsed and measured by paragraph to determine the final value. The highest valued Super Page is the optimal result.

4) Session driven requests: The optimizer must take into account a plurality of requests within a session. Those requests that can be associated with a valid common denominator Superset (i), Set (i, j) or Subset (i, j, k) keyword or cluster are considered related. Those that are not directly associated to the last end user's request are considered unrelated. Related requests that are not directly linked to the last request are considered inactive, whereas unrelated requests are mulligan and are omitted. Keywords that are considered to be too strong are de-emphasized from the ‘Boolean Algebra’ process and are known as ‘Zero Clusters’ that in turn are converted into Super Glyphs but removed from the environmental filtering process. Omitted keywords via mulligan are also converted into Super Glyphs that help during the process of weighting each Super Pages. A Super Page for each request has a ‘Deductive Reasoning’ W_Rank Basis value that determines the relative weight that ranges from 0.001 no good to 10 awesome.

5) Super Pages: The system uses the Super Sites to identify missing gaps of information, and logically inserts them into Super Pages. The systems also identifies auxiliary variables that consists of a collection of keywords that would be directly associated with keywords or clusters used in the environmental filtering process. The Super Page is an improvement over the traditional page rank, since it contains a plurality of values obtained from each valid request used to reach the final destination, and not just a single request. As a dynamic object the system can insert missing gaps of information, and then rank each page within its own limited IP Address or Super Site environment.

Cholti uses ‘Deductive Reasoning’ approach that is a clever and more intuitive criminal investigation means that mimics Sherlock Holmes case solving techniques. A language based search engine optimizer must use as point of reference a lingua franca that is mathematical and simultaneously integrates a particular language, personal, geospatial, time and corporate information.

Cholti Scripted Algorithm (hereinafter Cholti) is the commercial name of the client side of the XCommerce Architecture and these are its new features:

1) Restricting the Size of the Environment: Cholti is programmed to limit the size of the Internet environment between the Upper Limit of approximately 1 billion and Lower Limit of 1,024 page results compared to its existing size of approximately 30+ billion. The environment is subdivided parallel running planes that represent the different quality Q(x) of the sites from 0 to 10. Each Site also has a sub partition or Q(x, y) where y ranges from 1 to 100. Q(x, y, z) has a third dimension where z is the commercial value of the Keyword.

Once the system filters out redundancy and each Page and each Site is given a Quality value Q(x), Cholti can awards to each valid page a W_Rank Basis from 0.001 to 10. Each page based on there their page and site rank gets a W_Rank Basis as follows: 0=0.001, 1=0.01, 2=0.10, 3=0.25, 4=0.50, 5=1, 6=2, 7=4, 8=6, 9=8, and 10=10. When analyzing a given request Cholti may use other variables and mathematical filters to be able to shrink the environment optimally. Cholti software accomplish said task by doing the following:

A) Identifies each Keyword to be valid or invalid and then assigns to each keyword a raw vector value based on the raw magnitude. Verifies each keyword to belong to the left or right side of the brain, where English (E), Mixed (M) and some geospatial (G) belonging to clusters comprise the [L] (left side) and geospatial information comprises the [R] (right side). The Mayan lingua franca Cholti is based on the use of Glyphs from combining [L] left side and [R] right side information to express a thought, thus the software also mimics the same.

B) Creates an Auxiliary Variables and Cluster List. See Example #1 XCommerce Finds missing gaps of Information.

C) Validates [L]+[R] side independent variables belonging to a request based on raw hits to see if they are valid by being below the 1 billion and above the Lower Limit 1,024 result page W_Rank Basis parameters.

D) Plots and maps keywords into a Basic Glyph configuration and determines the estimated ‘Boolean Algebra’ search value X[0] and then finds the best preprocessed Basic Glyph Y[0].

2) Estimated Point of Origin X[0] ‘Before’

A) Groups keywords to belong to (E), (M), (G), & (Z) categories.

B) (Z) are ‘Zero Clusters’ or very strong keywords. ‘Zero Clusters’ restrict a search, since they often obscure or hide the best results. We will later show how Zero Cluster limits ‘Boolean Algebra’ searches, and then show how to circumvent these pitfalls to yield optimal results.

C) An anchor is a single keyword that is used as a common denominator to shrink the size of the environment. See Example #2 Basic Glyphs. A cluster is a group of two to five consecutive keywords that consists of a valid English language common denominator that filters the size of the environment. [L] Left Side Basic Glyphs consists primarily of English grammar or language logical groups.

D) For each request made by the end user the system creates a bitmap that maps and assigns with an element each independent variable. Example: “American Civil War Battlefield” is converted to (G1+E1+E2+E3). Where “American”=G1, “Civil”=E1, “War”=E2 and “Battlefield”=E3. Cholti creates a bitmap that looks as this 1111. 1 denotes that a keyword is valid and 0 invalid or already used.

E) Superset (i) is the primary filter that attempts to shrink the size of the environment to 4,194,304 W_Rank Basis. The anchor keyword or the best filtering word is “Battlefield” or E3. Cholti determines that “Civil War” or (E1+E2) and “American Civil War” or (G1+E1+E2) are valid clusters. The system always assigns for a Superset the top valid Cluster filter. In this case “American Civil War” is the top cluster that is less than approximately 1 billion and greater than 4,194,304 W_Rank Basis. Thus, Cholti assigns to Superset (i) the cluster “American Civil War” or (G1+E1+E2) and then updates the bitmap to 0001.

F) Set (i, j) is the secondary filter that attempts to shrink the environment to a size of 131,072 W_Rank Basis. The anchor keyword or the remaining best filtering word is E3 or “Battlefield”. Cholti determines no valid clusters are available. The system always assigns for a Set the top valid Cluster filter otherwise the highest valued keyword. In this case “Battlefield” or E3 within Superset (i) consisting of “American Civil War” or (G1+E1+E2) is the top keyword that is greater than 131,072 net result pages or W_Rank Basis. Thus, Cholti assigns to Set (i, j) the keyword “Battlefield” or E3 and then updates the bitmap to 0000.

Example: End user's request is “American Civil War Confederate Battlefield”. Cholti converts it into (G1+E1+E2+E3+E4) and has a bitmap of 11111. “American Civil War” or (G1+E1+E2) is the Superset (i), and “Confederate” or E3 is the Set (i, j) and updates the bitmap to 00001.

G) Subset (i, j, k) is the tertiary filter that attempts to shrink the environment to a size of 16,384 net result pages or W_Rank Basis. The anchor keyword or the best filtering word is “Battlefield” or E4. Cholti determines no valid clusters are available. The system always assigns for a Subset the top valid Cluster filter otherwise the highest valued Keyword. In this case “Battlefield”=E4 is the top keyword within Superset (i) consisting of “American Civil War” or (G1+E1+E2) that is within the Set (i, j) “Confederate” or E3 that is greater than 16,384 W_Rank Basis. Thus, Cholti assigns to Subset (i, j, k) the keyword “Battlefield” or E4 and updates the bitmap to 00000. Neural network subject layers such as Superset (i), Set (i, j) and Subset (i, j, k) are also known as alternative representation of the features of the resource as input for classification of a relevance of a plurality of concept terms to the resource.

Example: End user's request is “American Civil War Confederate Battlefield Gettysburg”. Cholti converts it into (G1+E1+E2+E3+E4+G2) with a bitmap of 111111. Superset (i) consists of the cluster “American Civil War” or (G1+E1+E2), the Set (i, j) consists of the keyword “Confederate” or E3, and Subset(i, j, k) consists of the keyword “Battlefield” or E4 and updates the bitmap to 000001.

H) Left Side data exists as long as Superset(i) or Set(i, j) or Subset(i, j, k) are greater than 0. [R] Right Side Glyphs consists of geospatial keywords that are expressed as Geodata (w, x, y, z) vectors. Where each letter refers to the following: w=country, x=state, y=city or county and z=zip code. Geodata (w, x, y, z) belongs to the [R] right side and is the counterpart of the [L] left side anchors and clusters that modify the W_Rank Basis value of each page.

Example: End user's request is “Wachovia Bank”. That in turn is converted into (G1+E1) and has a corresponding bitmap of 11. (G1+E1) is the Set (i, j). The Superset (i)=0 and the Subset (i, j, k)=0.

I) Only during the Y[3] or the third point of the triangulation is that Cholti attempts to find the optimal result.

3) Preprocessed Basic Glyph patterns Y[0]

Preprocessing is done by AI Spider Parsers that scan, gather, analyze and update the content of the environment. Cholti and XCommerce creates a master hierarchical distribution known as the ‘CORE List’ comprising of 100,000 Superset (i) that is partitioned into 10,000,000 of subordinate Set (i, j) and is further partitioned into 1,000,000,000 subordinate Subset (i, j, k) to solve for 95% of the random surfing searches to the final destination. The list is further reinforced with a list of 15,000,000 keywords, 10,000 real time, 100,000 hourly, 1,000,000 daily, 10,000,000 weekly, 100,000,000 monthly and 1,000,000,000 yearly top requests based on the usage pattern of the entire Internet that are estimated to solve 95% of the direct searches to the final destination. An exact or direct request is one that reaches the final destination in one request. Exact or direct searches are estimated to be 30% of the traffic whereas random surfing the remainder 70%. Data warehousing resource intensive preprocessing are performed for each keyword as follows: About 90% of the keywords belonging to ‘CORE List’ are geospatial and have no auxiliary variables or clusters lists and are known as Geodata (w, x, y, z). The remainder 10% of the keyword has the top 8 to 32 clusters and the associated auxiliary variables with Hot & Cold parameters. The ‘CORE List’ or optimal element (A) as taught on FIG. 67 of parent application U.S. Pat. No. 7,809,659 “The (U) is even distributed amongst a (8×8) cluster where each node consists of sets (I, J) n that are further subdivided into subsets (I, J, K) n, that are further subdivided into groups (I, J, K, L) n of links where the system desires to obtain the optimal element (A). Each set (I, J) n possesses its own Database Index collection of compressed files.

Ax or ‘Before’ is an end user request made with ‘Boolean Algebra’ and create a default hierarchical set with specific limits as follows:

A) Superset (i) size is less than 1 billion and greater than 4 million net result pages W_Rank Basis. The Superset upper limit is the minimum of (Superset (i) W_Rank Basis*1.33 or 1 billion). The Superset lower limit is the maximum of (Superset (i) W_Rank Basis*0.70 or 4,194,304). Where Superset (i)>Set (i, j)>Subset (i, j, k). The overall Superset (i) has the upper limit of the highest valued Superset (i) and the highest valued lower limit in a session.

B) Set (i, j) size is less than Set (i, j) upper limit and greater than Set (i, j) lower limit expressed in net result page or W_Rank Basis. Set (i, j) upper limit is minimum of (Ax Set (i, j) W_Rank Basis*0.7 or 33,554,432). Set (i, j) lower limit is maximum of (Ax Superset (i) lower limit*0.2 or 262,144).

C) Subset (i, j, k) size is less than Subset (i, j, k) upper limit and greater than Subset (i, j, k) lower limit expressed in net result pages or W_Rank Basis. Subset (i, j, k) upper limit is minimum of (Ax Subset (i, j, k) W_Rank Basis*0.7 or 262,144). Subset (i, j, k) lower limit is maximum of (Set (i, j) lower limit*0.2 or 16,384).

D) Each Superset (i) of a session is greater or equal to all the valid Set (i, j) subordinate domains. Each Set (i, j) of a session is greater or equal than all the valid Subset (i, j, k) subordinates domains.

E) A session may a have up to 20 significant ‘before’ requests. Each request has at least one Superset (i) such as ‘before’ ‘after’, and ‘improved’. Superset (i) may have a plurality of valid Set (i, j) for a given request. Set (i, j) may have a plurality of valid Subset (i, j, k) for a given request. Each valid request has at least one Superset (i) or one valid geospatial Glyph. Each valid Superset (i) has a plurality of Set (i, j). Each valid Set (i, j) has a plurality of Subset (i, j, k).

Example: The Basic Keyword is “War”=E1. Cholti will develop “War” as the Superset (I=1) and “War+DV pairs+Homepage” Superset (I=2). Where Superset (I=1) is the upper limit and Superset (I=2) is lower limit.

Example: Superset (1)=“War” and Superset (2)=“War+DV+Homepage” will have a plurality of valid Set (1, j 1-4) broadest, Set (2, j 1-4), Set (3, j 1-4), Set (4, J 1-4) narrowest. Thus Civil War, American Revolutionary War, War World I, War World II, Iraq War, Vietnam War exists based on the value of the cluster at the moment of the calculation.

Example: Subset (1, 1, 1-16) . . . Subset (4, 4, 1-16) for a total of 256 or (4*4*16) valid sets. Note some Subset (i, j, k) or Set (i, j) may be null or empty. Note: if a Superset (i), Set (i, j) or Subset (i, j, k) is not null then it must comply with the numeric Upper and Lower limits.

F) Cholti uses Q (x, y, z) values to filter and shrink each member of the hierarchical set to its top 1024 W_Rank Basis.

G) When a request is not part of the ‘CORE List’ the following procedures occur: 1) each active HQ node rearward chains to the HQ owner the request the top 1, 5, 10, 50, 100, 500, and 1024 Q(x, y, z) values via environmental bitmap. 2) Then HQ owner of the request match/merges the environmental bitmap information with Q(x, y, z) information of its subordinates and determines the Q(x, y, z) value that yield the top 1024 values. 3) Then HQ owner of the request forward chains to each participating HQ nodes the ‘Cherry picking’ Q(x, y, z) values. 4) Participating HQ node rearward chain the information to the HQ owner. 5) The HQ owner creates a localized Z_Price Bitmap. 6) The HQ owner rearward chains the localized Z_Price Bitmap 7) The AI Spider Parsers analyzes the content of the bitmaps and then determines if the information is of significant difference based on traffic usage patterns to be included in the ‘CORE List’.

H) Alternatively to G) the system identifies the closest common denominator Basic Glyph known patterns Q(x, y, z) and adjusts the value for a slightly broader search. Then performs all the steps in G). The difference is that many top values of HQ nodes may be null, drastically reducing the match/merge process. HQ nodes always send top 1, 5 and 10 results or send a null bitmap response.

4) First Point of the Triangulation X[1] ‘After’

A) Cholti reorganized the end user's request and transforms the Basic Glyph and converts them into an Advanced Glyph or a valid search pattern of behavior. Clusters are converted into Unload or Loaded Cholti Symbols or C(x). Single keyword remains as they were. Then Cholti creates a bitmap the size of the valid independent variables, based on request made on the end user. For example “American Civil War Battlefield” is converted to (C1+E3). Where “American Civil War”=C1 or (G1+E1+E2) and “Battlefield”=E3. Cholti request bitmap looks as 1111. 1 denotes that a keyword is valid and 0 used. During the Hot & Cold Algorithm evaluation Unload Cholti Glyphs that are determined to be reasonable or certain become Loaded Cholti.

B) Superset (2) denotes ‘After’. See Example #3 Advanced Glyphs. Superset (2) or ‘After’ is the primary filter that attempts to shrink the environment to a size of 1,048,576 net page results or W_Rank Basis. The anchor keyword or the best filtering word is Battlefield or E3. Cholti determines that clusters “Civil War”=C1 or (E1+E2) and “American Civil War”=C2 or (G1+E1+E2) are valid or Unloaded Cholti Symbols. The system always assigns for a Superset (i) the top valid filter Cluster. In this case “American Civil War” is the top cluster that is less than 1 billion hits and greater than 1,048,576 W_Rank Basis. Thus, Cholti assigns to the Superset (i) “American Civil War” or (G1+E1+E2) and then updates the bitmap to 0001. Note: Bx limits are ¼ of Ax limits when a valid cluster is calculated since Cholti estimates exact match patterns where (G1+E1+E2) becomes “G1+E1+E2”.

D) Set (i, j) is the secondary filter that attempts to shrink the environment to a size of 32,768 net page results or W_Rank Basis. The anchor keyword or the best filtering word is E3 or “Battlefield”. Cholti determines no valid clusters are available. The system always assigns for a Set (i, j) the top valid filter Cluster otherwise the highest valued Keyword. In this case “Battlefield”=E3 is the top keyword within Superset (i) consisting of “American Civil War” or (G1+E1+E2) that is greater than 32,768 result pages W_Rank Basis. Thus, Cholti assigns to Set (i, j) the keyword “Battlefield” or E3 and updates the bitmap to 0000.

Example: End user's request is “American Civil War Confederate Battlefield”. Cholti converts it into (G1+E1+E2+E3+E4) with a corresponding bitmap of 11111. C1=(“G1+E1+E2”) or “American Civil War” is the Superset (i), E3 or “Confederate” is the Set (i, j) and updates the bitmap to 00001.

E) Subset (i, j, k) is the tertiary filter that attempts to shrink the environment to a size of 4,096 W_Rank Basis. The anchor keyword or the best filtering word is Battlefield or E4. Cholti determines no valid clusters are available. Cholti always assigns for a Subset (i, j, k) the top valid filter Cluster otherwise the highest valued keyword. In this case, “Battlefield”=E4 is the top keyword within Superset (i) “American Civil War” or (G1+E1+E2) and within Set (i, j) “Confederate” or E3 that is greater than 4,096 net page results. Thus, Cholti assigns the keyword “Battlefield” or E4 to Subset (i, j, k) and then updates the bitmap to 00000.

Example: End user's request is “American Civil War Confederate Battlefield Gettysburg”. Cholti converts it into (G1+E1+E2+E3+E4+G2) and a bitmap of 111111. “American Civil War”=C1 or (“G1+E1+E2”) is the Superset (i), “Confederate”=E3 is the Set (i, j), and “Battlefield”=E4 is the subset (i, j, k) and updates and modifies the bitmap to 000001. In this case the geospatial keyword “Gettysburg” or G2 helps valorize the value of each valid page.

Example: End user request is “Wachovia Bank”. Cholti converts it into C1 or (“G1+E1”) and has a corresponding bitmap of 11. C1 or (“G1+E1”) is the Set (i, j). The Superset (i)=0 and the Subset (i, j, k)=0.

F) Geodata (w, x, y, z) multipliers may change from ‘Before’ to ‘After’ when creating optimal size of environmental hierarchical sets when using Hot & Cold Algorithm parameters.

5) Preprocessed Advanced Glyph patterns Y[1].

Preprocessing is done by AI Spider Parsers that update the content of the environment. Cholti and XCommerce create the environment size (2) or Superset, (2, j) or Set and (2, j, k) Subset ‘After’ that will be used for an entire session.

Bx or ‘after’ is the reorganized end user request made by Cholti and the hierarchical set limits are as follows:

A) Superset (2) size is greater than 256 million and less than 1 million result pages or W_Rank basis. The Superset upper limit is the minimum of (Superset (2) W_Rank Basis*1.33 or 256 million). The Superset lower limit is the maximum of (Superset (i) W_Rank Basis*0.70 or 1,048,576). Where Superset (i)>Set (i, j)>Subset (i, j, k).

B) Set (2, j) size is less than Set (2, j) upper limit and greater than Set (2, J) lower limit. Set (2, j) upper limit is the minimum of (Bx Set (2, j) W_Rank Basis*1.33 or 8,388,608 net result pages W_Rank Basis). Set (2, j) lower limit is the maximum of (Bx Set (2, j)*0.7 or 65,536 net result pages W_Rank Basis).

D) Subset (2, j, k) size is less than Subset (2, j, k) upper limit and greater than Subset (2, j, k). Subset (2, j, k) upper limit is the minimum of (Bx Subset (2, j, k)*1.33 or 65,536 net result pages or W_Rank Basis). Subset (2, j, k) lower limit is the maximum of (Bx Subset (2, j, k)*0.70 or 4096 net W_Rank Basis).

E) Superset (2) of the session is greater or equal to all the valid Set (2, j) subordinate domains. Each Set (2, j) is greater or equal to all the valid Subset (2, j, k) subordinate domains.

F) When a request is not part of the ‘CORE List’ the HQx owner uses the Ax derived Q(x, y, z) filter and multiplies it value by a coefficient to narrow by ¼ the search the forward chains the request to all the participating nodes.

6) Second Point of the Triangulation X[2] ‘Improved’

A) Cholti matches/merges the results derived from the Basic and Advanced Glyphs.

Then the Hot Algorithm valorizes each of the missing keyword required to make a valid cluster.

Example: In the request “War”, the missing keywords used by the Hot Algorithm to create valid Sets (i, j) are “Civil”, “American Civil”, “Iraq” & “World”|(“I|II”) etc . . .

B) Superset (3) or ‘Improved’ uses the bitmap for Superset (2) ‘After’. Superset (3) denotes ‘Improved’ weighted and correlated data. The ‘Improved’ hierarchical set of Superset (i), Set (i, j) and Subset (i, j, k) have limits.

C) Geodata (w, x, y, z) has the follow range of values: ‘Before’ from (0.0001 to 1), ‘After’ from (0.001 to 15), ‘Improved’ from (0.01 to 255), Sites or IP Addresses from (0.1 to 4095), and ANI or telephone numbers from (1 to 65535).

D) Keywords, clusters, Glyphs and Geodata have a Social Security numbers or fingerprint that are used to parse the data. These are Social Security numbers help filter large amounts of data. Fingerprints are evenly distributed amongst keyword and Super Sites, based on supply side criteria such as demand and media value.

E) Cholti uses Q (x, y, z) and Super Glyphs to generate a mathematical equation that is able to optimally shrinks the environment, and determine the weight of Super Sites and Pages.

F) A Super Site is linked to a plurality of (green) geospatial and (orange) corporate Super Glyphs that maximizes W_Rank Basis values in a search.

G) Both Super Sites and Super Pages are objects that may a plurality of relative values in a given session. All Super Pages are subordinates to a parent Super Site. A Super Page may be subordinates to a parent Super Page.

H) As a final process Geodata, clusters and relevant keywords are converted into mathematical equations Super Glyphs to derive the Dx or ‘Optimal’ Sample. Thus, when everything is said and done the search becomes a simple mathematical exercise. Once HQ owner ‘Cherry picks’ the Dx ‘Optimal’ response it rearward chains the information to the end user. See Example #4 Super Glyphs.

7) Match/Merge Glyphs Process Y[2]

Preprocessing is done by the XCommerce Supercomputer that updates the content of the environment using the following configuration: MPS™ HQ manage Superset (i) where I=1 to 4, SIS™ HQ manage Set (i, j) where J=1 to 4, TWS™ HQ manage Subset (i, j, k) where K=1 to 16. XCommerce load balances and optimizes throughput and measures four samples at the same time I=1 to 4 or Ax, Bx, Cx, and Dx searches. XCommerce creates the ‘Improved’ environment size for Superset (3), Set (3, j) and Subset (3, j, k) that will be used for an entire session.

Cx or ‘improved’ is the reorganized end user request made by Cholti and the hierarchical set limits are as follows:

A) Superset (3) size is less than 128 million and greater than 524,288 result pages W_Rank Basis. The Superset upper limit is the minimum of (Superset (3)*1.33 or 128 million net result pages W_Rank Basis). The Superset lower limit is the maximum of (Superset (i)*0.70 or 524,288 W_Rank Basis). Where Superset (i)>Set (i, j)>Subset (i, j, k).

B) Set (3, j) size is less than Set (3, j) upper limit and greater than Set (3, j) lower limit. The Set (3, j) upper limit is the minimum of (Cx Set (3, j)*1.33 or 4,194,304 net result pages or W_Rank Basis). Set (3, j) lower limit is maximum of (Cx Set (2, j)*0.7 or 131,072 W_Rank Basis).

C) Subset (3, j, k) size is less than Subset (3, j, k) upper limit and greater than Subset (3, j, k) lower limit. Subset (3, j, k) upper limit is the maximum of (Set (3, j) Lower limit*0.5 or 16,384 net result pages or W_Rank Basis). Subset (3, j, k) lower limit is the minimum of (Set (3, J) Lower limit*0.5 or 1024 W_Rank Basis).

D) Superset (3) of the session is greater or equal to all the valid Set (3, j) subordinate domains. Each Set (3, j) of the session is greater or equal to all the valid Subset (3, j, k) subordinate domains.

8) Hot & Cold Algorithm (dynamically calculated)

A) Cholti measures Superset (i), Set (i, j), Subset (i, j, k) and Geodata (w, x, y, z) managerial hierarchy using hot values that reflects the probability or influence an end user's wants for a given keyword. Cholti uses these probabilities when creating logical distribution of resources. All Sessions are owned by the MPS™ (HQ6 and HQ5) that converts glyphs into mathematical Super Glyphs. All Supersets are owned by the SIS™ (HQ4 and HQ3). All Sets are owned by the TWS™ (HQ2 and HQ1). All Subsets are owned by HQ0 nodes. Cholti identifies ‘CORE List’ keywords, clusters and Glyphs. MPS™ creates all Z_Price Bitmaps.

B) Each request may have a Basic and Advanced Glyphs. Cholti after each request updates the hot or relative vector value and the cold or relative influence value for each keyword. Keyword frequency and usage patterns can temporarily convert keywords into a ‘Zero Cluster’ or vice versa. By arranging keywords into Basic and Advanced Glyphs Cholti is able to request for optimal Z_Price Bitmaps that has enough information to bypass resource intensive Ax, Bx, Cx, and Dx calculations since they already have the Q(x, y, z) filtering parameters that yields the top 1,024 net page results W_Rank Basis.

C) Hot Algorithm parameters are assigned a higher value the closer the keyword belongs to the last request or is part of significant requests in a session. The Hot Value probabilities helps change the filtering parameters, so that Superset (i), Set (i, j) and Subset (i, j, k) environment sizes approach the lower limits. Once the optimal Super Glyph equation is available the MPS™ creates the Z_Price Bitmap.

D) Cold Algorithm parameters are assigned a lower value when keywords that are denser based on their ‘Boolean Algebra’ value belongs to non significant requests in a session. The Cold Value probabilities helps change the filtering parameters, so that Superset (i), Set (i, j) and Subset (i, j, k) net result pages or W_Rank approach the optimal maximal limits. Cold Values probabilities help Cholti and XCommerce to decipher the best result using ‘Deductive Reasoning’ instead of using ‘Boolean Algebra’ or ‘Caesar's divide and conquer’ means.

E) Based on Ax ‘Before’ and Bx ‘After’ samples and adjusting the environment with Hot & Cold Algorithms the system creates a Super Glyph collection that measures the top Super Site Top 1,024 W_Rank Basis.

F) After Cholti identifies a significant difference request by measuring the change in magnitude the present request is compared to its predecessor. The first valid request is always significant, since it compares against 0 that reflects the entire Internet environment or 30+ result pages. The system readily weights the value of each keyword, cluster and Glyph using Z_Price Bitmaps data from XCommerce.

G) Cholti identifies and validates interactively (or as the end user is typing) and determines each keyword, cluster and best fit Geodata (w, x, y, z).

H) Cholti has specific guidelines to create and identify Basis and Advanced Glyphs. These patterns are continuously updated as the system adds new items to its ‘CORE List’. Once the software is able to identify a predefined Basic and/or Advanced Glyph it will immediately have optimal environment results for sessions with exactly one request. When the system has in its possession a Z_Price Bitmap with optimal preprocessed results, it bypasses Ax, Bx, Cx, Dx searches and has the corresponding Superset (i), Set (i, j), and Subset (i, j, k) hierarchical set.

I) Cholti creates a probability telecommunication link tree that associates people, sites and ANI based on analysis of plausible Geodata.

J) ‘CORE List’ is stored in a Data Warehouse that contains all the valid Glyphs. Items are stored into the ‘CORE List’ each time a newly derived valid Glyph is dynamically encountered with a Z_Price Bitmap with up to 1,024 results. ‘CORE List’ has predefined all the Geodata (w, x, y, z) and corporate data. MPS™ assigns keyword and Geodata probabilistic filter values when performing a search. MPS™ ‘cherry picks’ the top 1, 5, 10, 50, 100, 500, and 1000 responses for each Superset (i) derived the environmental bitmap created by SIS™ nodes. U.S. Pat. No. 6,614,893 and its continuations teach how the forward and rearward chaining of environmental information is synergistically accomplished amongst subordinates and superiors (vertical) and between siblings (horizontal).

K) SIS™ assign values to each Set (i, j) based on the Cold Algorithm probabilistic value of each Glyph and remainder list of unused keywords. SIS™ ‘cherry picks’ the top 1, 5, 10, 50, 100, 500, and 1000 responses for each Set (i, j) derived from the environmental bitmap created by TWS™ nodes.

L) TWS™ assign values to each Subset (i, j, k) based on the Hot Algorithm probabilistic value of each Glyph and remainder list of unused keywords. TWS™ ‘cherry picks’ the top 1, 5, 10, 50 and 100 results from Subset (i, j, k) derived the environmental bitmap created from HQ0 nodes.

M) HQ0 or nodes parse information based on a given Glyph search pattern to derive a small size environment, and then uses Super Glyphs collections to weight results using Hot & Cold Algorithms probabilistic values, and each keyword specific vector dimensions to identify the TOP 1, 5, 10, 50 and 100 results. By default, the TOP 10 results are sent to superiors as an environmental bitmap.

N) Glyphs main purpose is to optimally shrink the size of the environment. When a Glyph is an exact match to an end user's response the system bypasses all search process, and displays Z_Price Bitmap information that is optimal and up to date, absent of making any calculation since Cholti has the answer with certitude.

9) Third Point of the Triangulation: Cholti dynamically calculates if each request is of Significant Difference by doing the following:

A) Predefined exact Glyphs are automatically responded as optimal with the Z_Price Bitmap (or Dx) responses contained in the ‘CORE List’ that are stored in the Business Intelligence Data Warehouse, since the response information is certain. The Z_Price Bitmap also has the Q(x, y, z) with top 1,024 W_Rank Basis for Super Pages, and has the Q(x, y, z) with top 1,024 W_Rank Basis for Super Site information.

B) When a valid Glyph is absent Cholti can logically decipher the missing gaps of information and automatically reasonably select the optimal Z_Price Bitmap (or Dx) responses contained in the ‘CORE List’ since the response information is reasonably known. The optimal environment is derived using Hot and Cold Algorithm parameters and hierarchical sets. Q(x, y, z) derived from Cx ‘Improved’ permit Cholti to go straight to the ‘Cherry Picking’ process.

C) For each request Cholti determines if an appropriate Basic and Advanced Glyph exists. Then based on the unused independent variables relative vector magnitude decides whether or not to instantiate a search. If the system determines a search is not required, the end user's response is based on Z_Price Bitmap information. Otherwise, the Basic and Advanced Glyphs are matched/merged into a resultant hierarchal set.

D) When a session has exactly one significant difference request that is not part of the ‘CORE List’ the system arranges, organizes and creates an ‘Improved’ hierarchical set. Cholti weights each page result W_Rank Basis by using the Hot & Cold Algorithm parameters and weight Super Glyphs valorize optimal results.

E) The Hot & Cold Algorithm parameters generate Super Glyphs by using the optimal Q(x, y, z) filter to mimic mathematically the optimal environment. Thus Super Glyph objects consist of an array of probabilities and weights that recreates the optimal environment with a size of 1,024 W_Rank result pages for each request in a given session.

F) Cholti only requests for an optimal request from XCommerce when a significant change is detected, otherwise it must correlate the data. When an optimal Z_Price Bitmap is used to correlate a plurality of common denominator related requests and converts them into a resultant that is considered a single request.

G) When Super Glyphs exists for a plurality of valid related requests the resultant Superset (i), Set (i, j) and Subset (i, j, k) is generated by the Z_Price Bitmap that contains the entire hierarchical set and is expressed with reasonable and probable Super Glyphs vector dimensions. A reasonable vector dimension has a probability greater than 95% of occurrence, otherwise it is probable. If no Super Glyph has a probability greater than 95%, then the top one is considered reasonable. Cholti valorizes with a grain of salt knowing the garbage in garbage out paradigm.

H) If multiple significant difference instances are detected during a session, then for each group a resultant Superset(i), Set(i, j) and Subset(i, j, k) is generated with the appropriate prorated Hot & Cold Algorithm parameters. Finally, the plurality of resultant Superset (i), Set (i, j) and Subset (i, j, k) are correlated to create a final hierarchical set. The results that are greater than a predefined threshold are measured otherwise they are excluded as being confounded. The final hierarchical set yields the top n optimal results. A Super Glyph can have values for a plurality of significant difference requests.

Example: Super Site XYZ has a value of 8 in the first request, 7 in the second request and 10 in the final request. It is determined for the final request three pages are an exact match and two other pages are valid after inserting the missing gaps of information. Thus Super Site XYZ has a W_Rank value of 50 for the final request.

10): Super Glyph mathematical equations: Using the Mayan lingua franca Cholti guidelines the system attempts to use grammar/language with geospatial components to describe an idea that is used to elucidate the final destination by doing the following:

A) Each end user begins interactively the process by typing requests using keywords and Cholti identifies, validates and verifies each keyword. Based on the typed end user's keyword combination Cholti creates both Basic and Advanced Glyphs and determines if a valid Geodata (w, x, y, z) exists.

B) XCommerce upon receiving a request from Cholti compares it against the ‘CORE List’ to determine if an exact match exists and responds with the optimal static Z_Price Bitmaps. Cholti mulligan unrelated keyword to the last request. XCommerce creates an ‘Improved’ hierarchical set derived from Z_Price Bitmaps for each significant request. Super Sites are assigned a probability and weight for each related group of requests or for a plurality of significant difference related group of requests. Direct relationship are extended from one request to another in a transitive manner, whereas unrelated request are skipped via the mulligan process that disregards confounded keywords, since they are converted into (yellow) unused Super Glyphs. Mulligan (yellow) unused Super Glyphs are used to weight pages and sites during the filtering process, and are very helpful during the process of ‘Deductive Reasoning’.

C) Cholti may interactively ask the end user to clarify their intentions, since confounding Geodata or keyword combinations exists. The system based on the new input from the end user is able to fine tune the value of existing Super Glyphs. The software query optimizer only makes Super Glyphs based on valid request.

These are new enhancements made to XCommerce Supercomputer that continuously gathers, distills, analyzes, primes and integrates in real time organizational data so that responses are synchronized with up to date information as follows:

1) Load Balancing Request: based on the quantity and quality of the informational entropy the system must identify, validate and verify the top responses associated to an end user's request. XCommerce has evenly distributed its node configuration in four equal parts. Each part comprises of a minimum of 64 HQ0 nodes for a minimal total of 256 HQ0 nodes. The production Supercomputer configuration has eight times more HQ0 nodes for a grand total of 2048 HQ0 nodes, while the superior tiers or HQ6 to HQ1 remain unchanged. The four parts of the system are identified as Ax, Bx, Cx, and Dx that are responsible for searching and responding optimal page results based on vector parameters. Mimicking the human brain each request is broken into keywords that are associated to belong to either to the [L] left or [R] right side group. When the [L] left side group keywords consisting of at least one independent variable will always have an Anchor made up of a keyword or cluster. The ability to identify keyword or cluster anchors in a hierarchical manner is paramount in creating valuable common denominator environments that are used as a valid point of reference when performing comparative analysis of a plurality of requests.

Example: The English language environment begins with an estimated size of 30 billion unique page ranks and then the system determines for a request that “American Civil War” is the primary anchor and filter. From the three words associated with “American Civil War” the most common or the keyword with the lowest magnitude is assigned as the Anchor. In this case “American Civil War” American is the most common keyword and therefore is the Anchor. The anchor “American” shrinks the environment below upper limit of tolerance of 1,073,741,824 net result pages or W_Rank Basis. The environment is further reduced when applying the cluster “American Civil War” when determining the valid Superset (i). In this case “American Civil War” cluster is able to further shrink the size of the environment to approximately 80,000,000 W_Rank Basis. The Superset (i) is divided into an organizational manner with smaller sized Set (i, j) that may contain a plurality of valid associated keywords and clusters (I, $A) (I,$B), and the organization distribution is further propagated if necessary into smaller sized Subset (i, j, k) that may contain additional associated keywords or clusters (I, $A, $X), (I, $A, $Y), (I, $B, $X) and (I, $B, $Y). $A, $B, $X or $Y consists of associated keywords or clusters. When a variable is null it has a probability of 0 or 0.00%. XCommerce always works with balanced hierarchical sets. The hierarchical set when creating Set (i, j) and Subset (i, j, k) subordinates takes into account known preprocessed Advanced Glyphs hierarchical sets.

XCommerce as all calculations are made it cleans, organizes, standardizes and mirror image of the existing Internet environment. When performing said task the system correlates the content of each paragraph, and page belonging to the same Site. The system primes each paragraph, and this is when confounding data is eliminated by supplying the missing gaps of information.

A) (Ax or ‘Before’ analysis): Ax represents traditional ‘Boolean Algebra’ or prior art means that are translated into Basic Glyphs. The requests are searched ‘AS IS’ using existing eigenvector methods for valorization means and the Ax response is used as the point of reference for further optimizations made by Bx, Cx, and Dx.

B) (Bx ‘After’ analysis): Bx represents the ability to reorganize requests and identify missing gaps of information that are converted and translated into Advanced Glyphs. Cholti identifies, validates and verifies the ‘AS IS’ query and rearranges each request. This method is the first step that filters and weights requests dynamically and identifies, quantifies and qualifies confounded ‘Boolean Algebra’ over simplifications.

C) (Cx ‘Improved’ analysis): Cx represents the process of comparing, mapping, plotting and merging both Ax and Bx to a resultant probabilistic hierarchical set. Then Cholti gathers, distills and analyzes Cx hierarchical set. During this process the best results of each given set of elements are measured using the Hot & Cold Algorithm parameters to update the Super Site and Super Site objects and create a probabilistic distribution to yield the optimal result. Cholti identifies, validates and verifies the ‘AS IS’ query and reorganizes and prioritizes Keyword. Cx mission is to reduce the size of the environment between 1,024 and 10,000 result page W_Rank Basis.

D) (Dx ‘Optimal’ analysis): Dx or Z_Price Bitmaps represents the final process of deciphering the optimal result that where derived from Cx hierarchical sets by weighting and valorize each page against Super Glyphs filters that take into account Page Rank, Media Value, and transparency and/or content privacy. Dx mission is to reduce the size of the environment to 1024 result page W_Rank Basis.

Cholti ‘Cherry picks’ the best results as information certitude improves proportionally as the size of the environment is reduced. Thus when information certitude is reached, the size of the environment equals the end user select page response sample. By default browser engine response sample is set to 10 and thus when information certitude is achieved the environment size is exactly 10 page results. Alternatively, TOP result pages 1,000 W_Rank may have a minimum of 512 pages.

2): Organizing the Spaghetti:

A) For each cluster, associate clusters and Glyphs the system assigns an HQ1-HQ5 owner that controls the parallel running Internet environment. Each HQ0 is assigned a plurality of keywords. Each HQ1 is assigned all the single tiered clusters of its subordinates. Each HQ2 is assigned all the dual tier clusters of its subordinates. Each HQ3 is assigned half of triple tiered clusters or Basic Glyphs of its subordinates. Each HQ4 is assigned all the Advanced Glyphs of its subordinates. Each HQ5 is assigned all the Geodata of the environment.

B) A Site based on a given extension such as “.com” is assigned to exactly one of the parallel running planes. All the pages of a Site are matched/merged with separations. Each site is read for clusters and ‘Zero Clusters’. Each site has a quality value or Q(x) that ranges from 0 to 10. Complex multinational corporate organizational hierarchies consist of a plurality of Super Sites that are linked together. Consequently, a Site is assigned a Corporate ID that contains all the valid ANI, address information, and organizational information.

C) A Site rank value is equal to the sum of its Top n W_Rank subordinates. Each Site is assumed to have Top 32 pages, even if most are null. The basis of each Site is equal Top 32 valid pages in its hierarchy from the perspective of a partial environment. The W_Rank Basis of each Page is equal to the Q(x) value.

D) Sites with Q(x)>1 and valid Corporate ID are considered a Super Sites. Pages with Q(x)>1 and valid Corporate ID are considered a Super Pages. Each keyword, cluster, dual tiered cluster and Advanced Glyphs has a Q(x) value>1.

3): Glyphs based Search

A) Each Site has a fingerprint or is associated to clusters, dual tiered clusters and Advanced Glyphs. SIS™ HQ nodes are assigned for Superset (i) searches, TWS™ HQ nodes are assigned for Set (i, j) and squad leader HQ0 are assigned to Subset (i, j, k). The HQ owner of the search uses the Ax ‘Boolean Algebra’ Search statistics to know the raw number of hits, top pages and sites that match the end user's criteria. The HQ owner forward chains the request to all pertinent nodes. Alternatively (faster!) the ‘Boolean Algebra’ results are kept in memory and the entire Ax ‘Boolean Algebra’ step is skipped unless a given combination does not exist in memory.

B) The owner of each keyword, cluster, dual tiered cluster and Advanced Glyph keep tracts in memory the TOP n value based on the Q(x) value that is used as a filter. Then they forward chain the Q(x) value to the HQx owner of a request. Reasonable results are kept in memory and probable in memory. Alternatively (faster!) the ‘Reorganized’ results are kept in memory and the entire Bx ‘After’ step is skipped unless a given combination does not exist in memory or in a file.

C) Each Super Site and Super Page are assigned to a keyword, ‘Zero Clusters’, cluster, dual tiered clusters and Advanced Glyph when they belong to the estimated TOP 1,000,000 W_Rank Basis of a given ‘Z_Price Bitmap’. This additional dimension or W is an extension to the Q(x, y, z) that can be used to further expedite searches.

D) Superset (i) search limits range from 16,384 to 131,072, Set (i, j) search limits range from 8,192 to 65536, and Subset (i, j, k) search limits range from 4,096 to 32,768 net result pages or W_Rank Basis.

E) Based on the quality of the Geodata Cholti assigns filtering values as follows: 1) Geodata (n, 0, 0, 0), multiplier=0.7, 2) Geodata (n, n, 0, 0) multiplier=0.5, 3) (Geodata (n, n, n, 0) or Geodata (n, n, 0, n)) multiplier=0.35 and 4) Geodata (n, n, n, n) multiplier=0.25. The Geodata value helps to weight each page and derive the optimal size environment.

F) When the Corporate ID is valid then multiplier=0.25. The Q(x, y) is used to prorate. Each Page also has a sub partition or Q(x, y).

G) The request HQ owner must determine the search parameter when filtering. The upper limit is always set to equal the highest Q(x) value. The lowest limit is calculated by estimating the size of the environment compared to the filter value multiplier. Q(x) total equals the summation of Q(x) from 10 to 2. Should Q(x) total value be less than the lower limit then Q(x) Total=lower limit.

Example: The system determines via the Ax Before calculation that “American Civil War” has approximately 80,000,000 page results. In this case only a Superset (i) exists. The system is interested in restricting the search that is within the request limit. The valid limits are from 16,384 to 131,072 W_Rank Basis, since no Corporate ID is known or Geodata is available. To shrink the environment Q (x, y, z) is used.

The system identifies the number of valid results based on the Q(x) values starting from 10 to 2. Initializing the Q(x) valid counter to zero, it begins to add Q(x) until the valid counter is greater than the upper limit and does not exceed it lower limit. Should it exceed the limit it must prorate using Q(x, y) values.

Example: the lower limit=1200, and upper limit=1900. Each Q(x) has 1000 items, and each sub partition has 10 items. The system initializes the valid counter and then adds 1000 items from Q (10), since the value does not exceed any of the search limits. Then Cholti analyzes and determines what to do with Q (9) data, since the extra 1000 items would exceed both limits. In this case, the system prorates the counter by filtering 80% of Q (9) and accomplish said task with Q (9, 20). The 20 is obtained from 100−80.

4) Hot Algorithm or Cx Optimizations: ‘Boolean Algebra’ assigns for each session the same value or 1 to each keyword. Cholti groups related requests, and thus continuously must dynamically measure each keyword based on the end user's usage and frequency patterns with a Hot Algorithm value. This value is obtained after correlating Ax ‘Before’ and Bx ‘After’ requests to yield the resultant Cx set hierarchy. These dynamic values are an enhancement to the generalization philosophy of the ‘Boolean Algebra’, since by taking trending in account, keywords and cluster priorities may elucidate what is hot. Once Cholti knows what is hot it can be measure the weight of Super Pages and Super Sites. The notion of static values for combinations of keyword is relegated to the process of shrinking the size of the environment, and dynamic values to the deciphering process of selecting the best solution. Hot Algorithm values do not affect ‘Zero Clusters’ for that the system uses Cold Algorithm values.

Example: As explained before the “American Civil War” cluster reduces the Ax environment size to 80,000,000 results. This ‘Boolean Algebra’ response represents the one to one relationship on how eigenvectors filter and valorize the environment. As a starting point it is good and for this reason Cholti uses this preprocessed type of information as the ‘Before’ or Ax and reorganizes for the ‘After’ or Bx. XCommerce ‘CORE List’ stores a plurality of commonly used request to avoid taxing unnecessarily the system throughput with redundant inquiries since Q (x, y, z) values are known.

The Hot Algorithm assigns to each keyword three components (x, y, z). x measures the trending multiplier based on the end user's pattern with regards using a keyword. y represents the relative strength of a keyword in belonging to the Advanced Glyph domain hierarchy such as Superset (i), Set (i, j) and Subset (i, j, k). z determines the probability the Keyword is necessary to reach the optimal W_Rank.

5) Cold Algorithm or Dx Optimizations: Once the Hot Algorithm has successfully helped value each site and page during the ‘Improved’ or Cx sample, by measuring patterns of behaviors of the end user's requests within a session. The Cold Algorithm assigns to each keyword four components (w, x, y, z) values. w measures the probability the word is required for the search. x measures the likelihood the keyword or a ‘Zero Cluster’ validates a W_Rank. y quantifies geospatial dimensions based on Geodata (w, x, y, z). z modifies Super Glyphs based on how Cholti measures the corporate dimensions of a request. y and z serves as a geospatial and corporate information filters to further reduce the size of the environment by assigning filter value from 0.01 to 1.00. Cholti never assigns a value of 0 since results are weighted down but never eliminated.

Example: Once the size of the environment for “American Civil War” is measured at 80,000,000 result pages as Ax or ‘Before’, and then reorganized and further filtered by Cholti to shrink the size of the environment to approximately 4 million result pages as Bx or ‘After’. Then the Hot Algorithm analyzes the valid Superset (i), Set (i, j) and Subset (i, j, k) by request and session to further reduce the size of the environment to approximately 100,000 result pages. Then the Cold Algorithm uses ‘Deductive Reasoning’ to decipherer logically the essence of the matter. Extracting the essence is done to the entire hierarchical set by request and session to further reduce the size of the environment to approximately 1000 result pages. At which point the system gathers the TOP 100 page as they compare against the Super Glyph to determine the optimal result page. Super Glyphs are mathematical filters that helps ‘cherry pick’ the best W_Rank.

6) Cholti language Super Glyphs: each request may have one or more components 1) Superset (i), 2) Set (i, j), 3) Subset (i, j, k) and 4) Geodata (w, x, y, z). Super Glyphs are colored coded. Blue belongs to English language Cluster, Purple is a ‘Zero Cluster’, Yellow are unused keywords in building an Advanced Glyph, Green is a geospatial, Orange is Corporate, Black is advertisement value, and White is end user supply side commercial value. Super Glyphs that becomes reasonable to the point of certitude become Red regardless of type.

A) Super Glyph can be unloaded or loaded. A Super Glyph is loaded when the information is certain or greater or equal than 0.95, else it is unloaded. Each Superset (i) measures the quality and probability that a request is within this partial concurrent analyzing environment. Each valid Superset (i) is represented by a blue colored loaded Super Glyph. Each Geodata(x, w, y, z) Super Glyph measures the quality and probability that the request is within this partial concurrent analyzing environment. Geodata (w, x, y, z) value for a request or session may be null. For each partial environment the system assigns a geospatial green colored unloaded or loaded Super Glyph depending on all probability of certainty of a request.

B) Each Set (i, j) and Subset (i, j, k) that is a common denominator to each request in the partial environment is certain and is represent by a blue colored Super Glyph. Non significant Set (i, j) and Subset (i, j, k) are represented by a yellow colored unloaded Super Glyph.

C) Corporate geospatial data derived from a request that is represented by an orange Super Glyph. When the Corporate geospatial data is almost certain it is loaded otherwise it has a p(x)<95% (or <0.95) and is unloaded.

D) If a partial environment does not possess a common denominator loaded Super Glyph with another partial environment, the system may omit them or do a mulligan from the point of view of the last request. When a mulligan occurs from the point of view of the last request, the information that is disassociated is treated as ‘Zero Clusters’.

E) ‘Zero Clusters’ are always loaded. ‘Zero Clusters’ have 0% or 0.00 ‘Boolean Algebra’ value, but are paramount for the process of using ‘Deductive Reasoning’ when deciphering what is the optimal solution. Unused keywords also have 0% or 0.00 ‘Boolean Algebra’ value, but are paramount for the process of using ‘Deductive Reasoning’ when deciphering what is the optimal solution. ‘Zero Clusters’ and unused keywords help eliminate confounding results.

F) Advanced Glyphs have 100% or 1.0 ‘Boolean Algebra’ value, but have no value or significance in the process of using ‘Deductive Reasoning’. Advanced Glyphs are a mathematical equation that shrinks the size of the environment. Once the optimal environment is derived these keywords that make part of the Advanced Glyphs are implied and logically removed from the deductive reasoning process. The number unmanaged independent variables in a search increase exponentially the complexity of solving the optimal solution.

7) Deductive Reasoning Triangulation

A) Significant Difference is an event of quantitative and qualitative importance. A significant difference occurs when an Advanced Glyphs consisting of a plurality of Super Glyph affects the size of the environment and elucidates reasonable paths to reach the final destination substantially. Thus a significant event occurs when two consecutive requests with a common denominator have a significant filtering disparity of the environment size. When two consecutive requests have the same Superset (i) and after measuring both instances the difference between them is greater than a factor of times eight a significant event is detected. A significant filtering of the environment occurs, when the environment shrinks by a factor of four or more and the Superset (i) and Set (i, j) are the same.

B) If the Geodata (w, x, y, z) is not null and is the same between two consecutive requests then raw factor is multiplied by two, making it easier to have a significant difference event. In addition if the Corporate ID is the same for two consecutive requests and is not null then the raw factor is further multiplied by two.

Example: the end user makes two related requests. First request is “American Civil War” with Ax (1) of 80,000,000 page results. Second request is “American Civil War Battlefield” with Ax (2) of 5,000,000 page results. Since, the environment shrinks by a factor of 16 or (80 M/5 M) and “American Civil War” is the common denominator Superset (i), hence Ax (2) is considered of significant difference.

C) Super Glyphs: is the process of converting English language words into mathematical equations that help yield optimal environment. Super Glyphs that are used by the Advanced Glyphs accomplish the task of creating a substantial small environment that has a plurality of common denominator elements such as Superset(i), Set(i, j), Subset(i, j, k) and Geodata(w, x, y, z). Then the remaining Super Glyphs are used in the process of ‘Deductive Reasoning’ to determine the weight of each site and page in a set hierarchy.

Once the weight of a site and page are known this information may help in determining from the last request point of view what is confounded. Environment size, usage patterns of behavior and total amount of valid requests affects the preprocessed Cold Algorithm threshold used by the software. ‘Deductive Reasoning’ analysis of the environment is done in a predefined manner. First, the preprocessed Cold Algorithm threshold is a value that measures the significant weight for each valid page. The threshold is set to a value that will distill at least 90% or 0.90. Second, the remaining 10% or 0.10 of the partial environment is further distilled another 90% or 0.90 using preprocessed Hot Algorithm threshold. Third, the system uses identified ‘Zero Clusters’ and Super Sites weighted values to further reduce the size of the environment another 90% or 0.90. These validations are performed as long as the size of the environment is greater than 1,024 W_Rank Basis limit.

Example: The partial environment size for “American Civil War Battlefield” is 5,000,000 page results W_Rank Basis. After the Hot Algorithm filtering the size of the environment is lowered to 500,000 page results W_Rank Basis, and then further reduced via the Cold Algorithm filtering the environment to 50,000 page results W_Rank Basis. Then Cholti dilutes the remaining environment based on the quality of the Super Sites to yield a valid environment size of 5,000 page results W_Rank Basis. As stated before Hot & Cold Algorithm parameters and ‘Zero Cluster’ filter may not reduce the size of the environment below 1024 weighted page results.

D) Decipherer: Once the size of the environment has reached optimal environment weighted size the system is able to decipher the plurality of significant different requests that best represents the end user's intention as follows:

Direct Surfing: Cholti is able to identify an exact keyword, cluster or dual tiered cluster or Advanced Glyph that has a Z_Price Bitmap with the latest responses, which is able to by pass the ‘Boolean Algebra’ search, since the information is certain readily available and environmentally and organizationally up to date.

Single Request Session: Cholti is able to group the keywords entered by the end user and organize them in Cholti language style Glyphs. The Ax and Bx are performed at the same time, and serve to calibrate, qualify and quantify responses. Cholti may estimate the results of Ax and Bx to avoid perform this resource intensive task provided the assumption is deemed to be reasonable or certain. As a final step the system correlates Ax and Bx information into a single version of the truth Cx hierarchical set. Presently, prior art or ‘Boolean Algebra’ search engine assign each page with a default weight of 1. In the case of Cholti each Super Page can have a value of 0.001 to 10 based on the quality of the Super Site and its associate Corporate Information.

Plurality of Related Request Sessions: The first two deciphering means reflect how present state of the art browser engine Supercomputers work. Unfortunately, most sessions can not be described as satisfying to the end user intentions in reaching the final destination in the first attempt. When the end user is dissatisfied a session will consists of a plurality of requests. Cholti will be able to tag and associate a plurality of requests. The system will be able to match/merge request that are not significant and are related. The software is able to create a single final resultant Cx after correlating a plurality of Ax and Bx of hierarchical sets. The Hot & Cold Algorithms parameters dynamically create an optimal size environment that valorizes the vector components of each valid element of the Cx hierarchical set and assigns up to date characteristics such as active, visible, reasonable probability and exact match weight. See Example #5 Related Requests.

Plurality of Unrelated Request Sessions: When Cholti determines a session possesses a plurality of consecutive unrelated requests, it must convert the unrelated keyword and clusters into (yellow) Super Glyphs. Cholti uses final resultant (yellow) Super Glyphs in the process of deciphering with ‘Deductive Reasoning’ the probabilistic values of each element. When Cholti creates the (yellow) Super Glyphs the associated vector components parameters describe statistically the plurality of unrelated requests or Mulligan requests. See Example #6 Mulligan Requests. Keywords that are removed via mulligan reduce the quantity of independent variables required to solve for the optimal solution.

Plurality Interrelated Request: When the system identifies a plurality of significant difference requests, Cholti is able to tag and associate these distinct hierarchical sets. The software is able to create a single final resultant Cx after correlating a plurality of Ax and Bx of hierarchical sets. When the correlation for a plurality of Ax and Bx requests is performed the result is a plurality of partial Cx. Then Cholti deciphers the different partial Cx and uses ‘Deductive Reasoning’ to determine the optimal Dx hierarchical set. Every time the end user clicks the ‘OPTIMAL button’ while using Cholti Software it is assumed the end user wants a final destination and the system can associate up to 20 consecutive and valid partial environments to derive an optimal satisfying Dx sample. Alternatively, the end user may have a ‘NEW button’ to initialize a session.

10) Cholti (AI) Artificial Intelligence Spiders: consists of automated programs that are designed to continuously gather, distill and analyze the environment in real time. The program after gathering information identifies new content to the known environment. For each page the program determines if the file has been deleted, moved, updated or is new. AI Spider capacities can be described as follows:

Delete Data: W_Rank is set to zero. Based on the previous W_Rank the system determines active keywords, ‘Zero Clusters’, clusters, dual clusters, and Z_Price Bitmaps if the removal of the W_Rank is of significant difference or sufficiently to affect a ‘CORE List’ inventory. Each Z_Price Bitmaps has a minimal W_Rank. If the deleted W_Rank is greater than the TOP 1000, the Index value where the existing W_Rank is set to zero, all the W_Rank below it are improved by one, and the TOP 1000 is adjusted. To avoid unnecessary resources intensive synchronizing of the inventory, Z_Price Bitmaps data structure stores TOP 1024 elements to avoid searching and recalculating replacement elements. Alternatively, once a page belongs to Z_Price Bitmap it is never eliminated it just has a lower value that the valid threshold of the top 1000 to solve for the optimal solution.

Move Data: W_Rank remain the same, and the IP Address is updated for future reference. Example: www.ibstek.com/main/technology.htm is changed to www.ibstek.com/home/technology.htm. File size, content and W_Rank are identical.

Update Data: The content of a page has changed. Four buckets are created: a) deleted, b) new, c) net deleted and d) net new. The software analyzes the net deleted bucket and determines active keywords, ‘Zero Clusters’, clusters, dual clusters, and Z_Price Bitmaps for removal of data. The software analyzes the net new bucket or file and determines active keywords, clusters, dual clusters, and Z_Price Bitmaps for insertion of data.

New Data: based on the site and associated links an approximate value W_Rank is created. Based on the approximate W_Rank the system determines active keywords, ‘Zero Clusters’, clusters, dual clusters, and Z_Price Bitmaps. Each Z_Price Bitmaps has a minimal W_Rank. If the W_Rank is greater than the TOP 1000 inventory, the programs checks up to 1000 element beginning with the first or top element and finds the first event W_Rank is greater and the new information is inserted in the given index then all the W_Rank below it are demoted by one, and the TOP 1000 is adjusted. Elements that are above the TOP 1024 may be discarded.

Significant Difference Data: Upon identifying significant changes to Z_Price Bitmap information belonging to a site hierarchy, the summary content of a Super Site and Super Page are updated.

11) Updating Page Ranks via Z_Price Bitmaps method: this process is an improvement to the XCommerce real time data model as follows:

A) Cholti Artificial Intelligence Spiders: these AI Spiders perform their standard searches for new information in the Internet. The Spider first determines the Quality Q (x) and the appropriate sub partitions Q (x, y, z) values. Then Cholti compares against the top responses derived from any known Z_Price Bitmaps and filters based on minimal valid page value parameter required to instantiate an event of significant difference in the environment. XCommerce stores all of the valid keyword, ‘Zero Clusters’, cluster, dual tier clusters and Advanced Glyphs in its ‘CORE’ List. Request HQ owners store in memory or archive in files reasonable balanced hierarchical sets once they are identified.

B) Cholti places to each page its existing page rank. In the event the page rank is unknown the system based on the quality of the parent site, page sibling and quality of ‘Zero Clusters’, reasonable hierarchical sets and Z_Price Bitmaps triangulates and temporarily estimates the page rank.

C) Plurality of New events: for each detected existing Advanced Glyph will attempt to update if the information is within the TOP 10,240 page result W_Rank basis. When Cholti determines the value exceeds the limit, the system immediately validates the event as having significant difference.

D) XCommerce updates the Z_Price Bitmap containing the list of 1,024 Top weighted pages, and 10,240 Top weight sites. Weight is used since, a page or site can have a weight greater than one. XCommerce updates the new limits for the Z_Price including the ‘Boolean Algebra’ counters for aggregate weight and frequency.

12) Cholti uses Super Glyphs to find the optimal responses. The end user begins a session consisting of consecutive requests from the end user to reach a plurality of optimal and valid final destinations. Request #1: “Sheraton Hotel Aventura” may be the exact response for a given search. Request #2: Then the end user gets the ANI (305) “###, ####” to make a reservation and finds out that the place is booked or it is too expensive so the search goes on . . . . The end user decides to find a Realtor that may assist him in finding a seasonal rental or a sweat condo buy, and using the city of Aventura in Miami-Dade County, Fla. as the center of its circle of search consisting of examples Requests #3-4. These two searches find a realtor that tells him about a great seasonal rental a boater's paradise with excellent marina view. Request #5: Then the end user is still not satisfied and continues its search to find travel arrangements and a car rental. Requests #6-10: the end user in order to make the vacation a success decides to find places of interest of where to stay. Request #1 is valid then via request #2 is determined to be invalid. Request #3 is not valid whereas #4 is optimal. Request #5 is optimal since site offer a package deal from travel and auto. Requests #6 to #10 may be optimal or not since the end user is undecided or just gathering information.

Once the Geodata (w, x, y, z) is derived to be the City of Aventura, Fla. USA, several Area Codes valid (orange) telecommunications Super Glyph (800), (888), (305), (786), (954) and (754) are assigned. The Super Glyph is red when end user interactively types significant difference valid ANI data. For each time that a Mulligan request is made the system creates a (yellow) Super Glyph for the Keyword, and by measuring via the Hot & Cold algorithms determines the patterns and frequency of usage for each keyword. Finally another algorithm measures using (black & white) advertisement Super Glyph that measure the end user's trend of using particular products and services, and the media value of the request. This is the so called z factor is the Q(x, y, z) while analyzing and solving for the optimal price. See Example #7 ‘Triangulation Deductive Reasoning’ Optimal Requests.

A caution to the reader the word optimal is tricky. 1) Does it mean the top response from a ‘Boolean Algebra’ response? 2) Does it mean the triangulation ‘Deductive Reasoning’ solution to the end user? 3) Does it mean the best solution after taking into account media value and all the valid requests with a session? The later is the correct answer. Consequently (black & white) advertisement Super Glyph metrics are required to measure viability or profitability and not just maximizing ‘Boolean Algebra’ values, and this fact is the core reason why creating profitable search algorithms is so difficult.

13) Alternative Load Balancing Configuration (faster!): All the HQs participate in Ax, Bx, Cx, and Dx process. Where the assigned HQ owner estimates the Ax value and then forward chains a message with the hierarchical set parameters for Bx. Each HQ node rearward chains the Bx response with the top 10 page results or null. The HQ owner performs the Hot & Cold Algorithm to generate the Q(x, y, z) filter and forward chains the message to each HQ node that did not send a null response. Each HQ node rearward chains the Cx response with the top 10 page results or null. Now the HQ owner ‘cherry picks’ the optimal result.

BRIEF DESCRIPTION OF THE DRAWINGS

For the purpose of initially illustrating the invention, the specification presents drawings, flow diagrams, and embodiments that are presently preferred as well as alternates. It should be understood, however, that the invention is not limited to the specific instrumentality and methods disclosed herein. It can be recognized that the figures represent a layout in which persons skilled in the art may make variations therein. In the drawings:

FIG. 1 presents a main page of the search engine optimizer;

FIG. 2 presents an output of a search executed by a plurality of search engines;

FIG. 3 presents a basic Glyphs left side;

FIG. 4 presents a basic Glyphs right side;

FIG. 5 presents a basic Glyphs overview;

FIG. 6 presents an advanced Glyphs left side;

FIG. 7 presents an advanced Glyphs right side;

FIG. 8 presents an advanced Glyphs overview;

FIG. 9 presents block diagram illustrating the process of stimulating the brain;

FIG. 10 presents a block diagram illustrating the process performed to reach certitude;

FIG. 11 presents various software symbols utilized by the search engine optimizer;

FIG. 12 presents a process utilizing a hot and cold algorithm;

FIG. 13 presents an enhanced Glyphs overview;

FIG. 14 presents a block diagram illustrating a deductive reasoning search; and

FIG. 15 presents a super Glyph overview.

DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS

These are the figures that describe Cholti:

FIG. 1: Cholti Search Engine Optimizer: (1000) Consists of the main page of the visual representation of the Cholti Scripted Algorithm. [A], [B], [C] and [D] represent leading ‘Boolean Algebra’ competitors, and [E] represents Cholti. Once the end user clicks (50) the Search button the system calculates ‘Before’ and ‘After’ (Ax & Bx) samples. This diagram shows the results for the Bx or ‘After’ request for “American Civil War Battlefield” the system has determined the accuracy for each Search engine as follows: [A]=85%, [B]=72%, [C]=58%, [D]=78% and [E]=86%.

(100) is the list of keywords typed by the end user, (200) consists the list of valid request that belong to a session, (300) represents Hot Algorithm vector component concerning each Keyword, (60) represent identified Auxiliary Variables, and (70) represent identified Clusters.

FIG. 2: ‘Boolean Algebra’ Search Engines: [A] or (10), [B] or (20), [C] or (30) and [D] or (40) represent leading browser engines that perform their calculation using ‘Boolean Logic’ or ‘Caesar's divide and conquer’ method. In this case the end user request is “American Civil War Battlefield”. Once the end user clicks on the corresponding ‘Search button’ or (50) the search begins. [B], [C] & [D] Search Engine have interactive cluster recognition that consists of a plurality of optimal valued preprocessed requests.

FIG. 3: Basic Glyphs [L] Left Side: Using Cholti (1000) the end user types the following keywords (200) “American Civil War Confederates Battlefield”. This request is measured to have (400) an overall accuracy of 61% to 85% and (500) quality level of 4. Respectively, (300) shows the relative accuracy of [A]=82%, [B]=84%, [C]=84%, [D]=85% the ‘Boolean Search’ Engines, and [E]=86% for Cholti or ‘Deductive Reasoning Search’ Engine. In this case the request is converted into (100) “American”=[G1], “Civil”=[E1], “War”=[E2], “Confederates”=[E3], and “Battlefield”=[E4]. The system selects (600) “American Civil War” or ([G1]+[E1]+[E2]) as the left side of the brain Superset (i). The system selects “Confederates” (700) or [E3] as the left side of the brain Set (i, j). The system selects “Battlefield” (800) or [E4] as the left side of the brain Subset (i, j, k).

FIG. 4: Basic Glyphs [R] Right Side: Using Cholti (1000) the end user types the following keyword (200) “Miami”. This request is measured to have (400) an overall accuracy of 31% to 60% and (500) quality level of 1. Respectively, (300) shows the relative accuracy of [A]=39%, [B]=32%, [C]=29%, [D]=26% the ‘Boolean Search’ Engines, and [E]=39% for Cholti or ‘Deductive Reasoning Search’ Engine. In this case the request is converted into “Miami” (100) or [G1]. The program selects “USA” (601) and assigns an unloaded Cholti Glyph as the right side of the brain Superset (i). The system selects “Florida” (701) with an unloaded Cholti Glyph as the right side of the brain Set (i, j). The system selects “Miami” (801) or [G1] as the right side of the brain Subset (i, j, k). After having the relative Cholti accuracy level of each browser engine the overall accuracy upper limit is adjusted to 39%.

FIG. 5: Basic Glyphs Overview: Using Cholti (1000) the end user types the following keywords (200) “American Civil War Battlefield Gettysburg”. This request is measured to have (400) accuracy level of 86% and (500) quality level of 5. Respectively, (300) shows the relative accuracy of [A]=85%, [B]=85%, [C]=72%, [D]=68% the ‘Boolean Search’ Engines, and [E]=86% for Cholti or ‘Deductive Reasoning’ Search Engine. In this case the request is converted into (100) “American”=[G1], “Civil”=[E1], “War”=[E2], “Battlefield”=[E3], and “Gettysburg”=[G2]. The system selects “American Civil War” (600) or ([G1]+[E1]+[E2]) as the left side of the brain Superset (i). The system selects “USA” (601) and assigns an unloaded Cholti as the right side of the brain Superset. The system selects “Battlefield” (700) or [E3] as the left side of the brain Set (i, j). The system selects “Pennsylvania” (701) and assigns an unloaded Cholti Glyph as the right side of the brain Set (i, j). The system selects “Gettysburg” (801) or [G2] as the right side of the brain Subset (i, j, k).

FIG. 6: Advanced Glyphs [L] Left Side: Using Cholti (1000) the end user types the following keywords (200) “American Civil War Battlefield”. This request is measured to have (400) an overall accuracy of 86% and (500) quality level of 4. Respectively, (300) shows the relative accuracy of [A]=85%, [B]=72%, [C]=58%, [D]=78% the ‘Boolean Algebra’ Search Engines, and [E]=86% for Cholti or ‘Deductive Reasoning’ Search Engine. In this case the request is converted into (100) “American”=[G1], “Civil”=[E1], “War”=[E2], and “Battlefield”=[E3]. The system selects “American Civil War” (610) or (“[G1]+[E1]+[E2]”) or C1 that is represented with a loaded Cholti as the left side of the brain Superset. The system selects “Battlefield” (710) or [E3] as the left side of the brain Superset.

FIG. 7: Advanced Glyphs [R] Right Side: Using Cholti (1000) the end user types the following keyword (200) “Gettysburg”. This request is measured to have (400) an overall accuracy of 86% and (500) quality level of 4. Respectively, (300) shows the relative accuracy of [A]=84%, [B]=84%, [C]=84%, [D]=84% the ‘Boolean Algebra’ Search Engines, and [E]=86% for Cholti or ‘Deductive Reasoning’ Search Engine. In this case the request is converted into (100) “Gettysburg”=[G1]. The system selects “USA” (601) and assigns a loaded Cholti Glyph as the right side of the brain Superset (i). The system selects “Pennsylvania” (701) or “PA” with a loaded Cholti Glyph as the right side of the brain Set (i, j). The system selects (801) “Gettysburg” or [G1] as the right side of the brain Subset (i, j, k).

FIG. 8: Advanced Glyphs Overview: Using Cholti (1000) the end user types the following keywords (200) “American Civil War Battlefield Gettysburg”. This request is measured to have (400) an overall accuracy of 86%-95% and (500) quality level of 5. Respectively, (300) shows the relative accuracy of [A]=95%, [B]=95%, [C]=95%, [D]=95% the ‘Boolean Algebra’ Search Engines, and [E]=96% for Cholti or ‘Deductive Reasoning’ Search Engine. In this case the request is converted into (100) “American”=[G1], “Civil”=[E1], “War”=[E2], “Battlefield”=[E3], and “Gettysburg”=[G2]. The system selects (600) “American Civil War” or (“[G1]+[E1]+[E2]”) or C1 represented as a load Cholti as the left side of the brain Superset (i). The system selects “USA” (601) and assigns a loaded Cholti as the right side of the brain Superset (i). The system selects “Battlefield” (700) or [E3] as the left side of the brain Set (i, j). The system selects “Pennsylvania” (701) with a loaded Cholti Glyph as the right side of the brain Set (i, j). The system selects “Gettysburg” (801) or [G2] with (802) loaded Super Glyph {Zip Code}, (803) unloaded Super Glyph {IP Address} and (804) unloaded Super Glyph {ANI} as the right side of the brain Subset. Where ANI equals telephone number ranges, loaded Cholti is certain or reasonable and unloaded Cholti probable. Cholti ‘cherry picks’ results to further shrink the size of the environment and the accuracy upper limit is adjusted to 96%.

FIG. 9: Cholti Simulates the Brain: this diagram explains the step by step process Cholti Scripted Algorithm performs to simulate the human brain. Tier 1 or Join Pyramid (or improbable) the system performs the minimal tasks of identifying, validating and verifying each Keyword and creating a list of Auxiliary variables and related clusters. Tier 2 or Simple Pyramid or (probable) is the process of associating each keyword to specific groups. Tier 3 or Hybrid or (English language or [L] left side of the brain) groups keywords into ‘end user’ and known clusters. An ‘end user cluster’ is determined by examining how an end user types keywords in a request and then measures common denominator consecutive keywords and order or priority in which they appear. Tier 4 or Complex (geospatial or [R] right side of the brain) maps and plots Keywords to geospatial clusters that will help valorizes and narrow down top W_Rank. (100) Cholti match/merges the content of the left side and right ([L]+[R]) to identify check mate combination that triggers the process of ‘Cherry picking’ the optimal result.

FIG. 10: Accuracy: this diagram explains step by step the process Cholti Scripted Algorithm performs to reach certitude or 100% accuracy. Accuracy is derived as informational entropy improves from vague [0] to certain [4]. [0] is the ‘Boolean Algebra’ approach that keywords are expressed as 1 valid and 0 invalid. The ‘Boolean Algebra’ supercomputers use vector components that are feed to the eigenvector based algorithms that select the top page ranks.

[1] or Superset (i) is the process of identifying the primary English [L] left side of the brain and geospatial (or Geodata (w, 0, 0, 0)) [R] right side of the brain primary filter that are used to shrink the size of the environment significant, and serve as the basis of the hierarchical set. [2] or Set (i, j) is the process of further distilling and reducing the environment and then partitioning the Superset(i) into a plurality of Set that have in common a secondary cluster (or keyword) and geospatial (or Geodata (w, x, 0, 0)). [3] or Subset (i, j, k) is the process of further distilling and reducing the environment and then partitioning the Superset (i) into a plurality of Set that have in common a secondary cluster (or keyword) and geospatial (or Geodata (w, x, y, z)). [4] Check Mate combinations or ‘Cherry Picking’ is the process of weighting the Super Sites and Super Pages against the collection of known facts or Super Glyphs to find the optimal result based on the present conditions of a session. Since ‘Boolean Algebra’ search engine have a session limit of one request Cholti always measures both the last request and the entire session for optimal results when it estimates a significant difference.

Note: Many leading search engines use Zip Code as their primary filter. This approach can confound a search, for this reason a more robust Telecommunication model is required. Based on U.S. Pat. No. 6,614,893 and its continuations, the Geodata (w, x, y, z) model was incorporated and represents geospatial data in a hierarchical format. Where w=Country, x=State, y=City, and z=Zip Codes that are within a radius of several miles of the latitude and longitude of the City and belong to the same LATA Area or State or Region. To further illustrate the advantages of the Geodata over Zip Code based search the model do the following: 1) Determines how a request affects a response is based on the logical geospatial hierarchical partitioning of the environment. Each a country partitioned into a plurality of Regions, LATA Areas (continental USA if required), NPA or Area Code, NXX or Exchanges and then Zip Codes. Example: A person lives in New Jersey one mile away from New York and the valid geospatial circle radius is fifteen miles, the Zip Code based on State, Area Code, and/or Exchange are worthless, while LATA and Region may yield significant and real results. 2) Geodata assigns probabilities and distances to each plausible match and thus removes all the associated confounding elements with the search. 3) Finds the missing gaps of information Super Sites and Super Pages. The primed information gathered in steps 1 to 3 is inserted into the {State}, {City}, {ANI}, {Zip Code} and {IP Address} Super Glyphs or collections of known facts. For this reason raw Zip Code should never be used as a filter for ‘Boolean Algebra’ search. The Geodata model is a significant improvement over Zip Code or City Name based searches, since it does not work with raw data. Instead the system does the following steps 1) primes the information to remove confounding data, 2) uses ‘Deductive Reasoning’ to solve for missing data and 3) insert the correct data associated to the search. To those readers in the telecommunication field in particular when billing, the confounding elements are similar to the infamous USOC.

FIG. 11: Cholti Software Symbols: can divided into four categories: Column (1) measures the quality of the request, where 0 is gray, 1 is violet, 2 is blue, 3 is green, 4 is light green, 5 is yellow, 6 is orange, and 7 is red. Column (2) measures the level of accuracy, based on the quality level as follows: [0] has 0% to 30% accuracy or outer circle, [1 to 2] has 31% to 60% accuracy or acceptable circle, [3 to 4] has 61% to 85% accuracy or traditional ‘Boolean Algebra’ circle, [5] has 86% to 95% accuracy or improved circle, [6] has 96% to 99% accuracy or inner and [7] is certain or 100% accuracy or ‘Cherry picking’ circle and thus the red color. Column (3) represents unloaded Cholti Glyphs and Column (4) represents loaded Cholti Glyphs. When identifying the optimal result the unloaded and loaded Cholti Glyphs are used to represent Super Glyph objects. A Super Glyph object is a dynamic object that has a plurality of vector components that are used to measures hierarchical sets.

FIG. 12: Hot & Cold Algorithm: once Cholti has measured a plurality of requests in a session see FIG. 14 the program is able to use the Hot and Cold Algorithm.

The Hot Algorithm measure trends and the Cold Algorithm measures ‘Boolean Algebra’ pitfalls. In the diagram the system has identified a plurality of keywords that are used in a session consisting of a plurality of requests. Cholti identified each keyword as follows: “American” or [E1], “Civil” or [E2], “War” or [E3], “Blue” or [E4], “Gray” or [E5], “Hotel” or [E6], “Lee” or [E7], “Meade” or [E8], “1863” or [M1], “July” or [M2], “Sheraton or [M3], Confederates [M4] or [E11], “Gettysburg” or [G1], “Pennsylvania” or [G2], “USA” or [G3], “North” or [G4], {Zip Code} loaded Cholti or [C1] and {ANI} loaded Cholti or [C2]. Note: When Cholti assigns a geospatial keyword to belong on the [L] left side instead of the right side like “American” or [G1] it set the Geodata to null, otherwise the geospatial information may dramatically dilutes the environment in a confounded manner. When a geospatial keyword is assigned in the [L] left side of the brain it can be referenced as a [M] or mixed keyword.

Since the session had a plurality of requests and thus all keywords are not at room temperature. Cholti determines the following keywords: [E1], [E2], [E3], [E6], [M3], [M4], & [G1] as Hot. Cholti determines the following keywords: [E4], [E5], [E7], [E8], [E9], [E10], [M1], [M2], [G2], [G3], & [G4] as Cold. [C1] and [C2] are valid and reasonable Super Glyphs. Red colored Super Glyph are certain and are fully loaded always and thus Hot words.

Once the optimal button is pressed in the browser, based on the consecutive related request, the system can create the appropriate hierarchical set, and then filter with geospatial information to ‘Cherry Pick’ using deductive reasoning the optimal result.

FIG. 13: Improved Glyphs Overview: Using Cholti (1000) the end user types the following keywords (200) “American Civil War Battlefield Gettysburg”. This request is measured to be certain (400) or has an overall accuracy of 100% and (500) quality level of 7. Respectively, (300) shows the relative accuracy of [A]=97%, [B]=97%, [C]=97%, [D]=97% the ‘Boolean Search’ Engines, and [E]=100% or certain for Cholti or ‘Deductive Reasoning Search’ Engine.

Using ‘Before’ or Ax from FIG. 5. The ‘Before’ request is converted into (100) “American”=[G1], “Civil”=[E1], “War”=[E2], “Battlefield”=[E3], and “Gettysburg”=[G2]. The system selects “American Civil War” (600) or ([G1]+[E1]+[E2]) as the left side of the brain Superset (i). The system selects “USA” (601) and assigned an unloaded Cholti as the right side of the brain Superset (i). The system selects “Battlefield” (700) or [E3] as the left side of the brain Set (i, j). The system selects “Pennsylvania” (701) and assigns an unloaded Cholti Glyph as the right side of the brain Set (i, j). The system selects “Gettysburg” (801) or [G2] as the right side of the brain Subset (i, j, k).

Using ‘After’ or Bx from FIG. 8. The ‘After’ request is converted into (610) “American Civil War” or (“[G1]+[E1]+[E2]”) or C1 represented as a load Cholti as the left side of the brain Superset (i). The system selects “USA” (611) and assigns a loaded Cholti as the right side of the brain Superset. The system selects “Battlefield” (710) or [E3] as the left side of the brain Set (i, j). The system selects “Pennsylvania” (711) with a loaded Cholti Glyph as the right side of the brain Set (i, j). The system selects “Gettysburg” (811) or [G2] with loaded Super Glyph {Zip Code} (812), unloaded Super Glyph {IP Address} (813) and unloaded Super Glyph {ANI} (814) as the right side of the brain Subset (i, j, k).

When the end user clicks into optimal button, the program will display the Super Glyph equation used to determine certainty.

FIG. 14: ‘Deductive Reasoning’ Search: is a diagram that illustrates the left side of the page (1000) with four request sessions. [1], [2], [3] and [4] use ‘Boolean Algebra’, and [1A], [2A], [3A] and [4A] use ‘Deductive Reasoning’ The right side of the page as per FIG. 12 shows how the results of the Hot and Cold Algorithms. As Hot & Cold Algorithm keywords and Super Glyphs values are calibrated Cholti is able to rewrite the request of existing ‘Boolean Algebra’ search engines.

As more significant difference events are encountered and check mate combinations are detected in [4A] Cholti is able to ‘Cherry pick’ the optimal result. Should a [5] and [5A] request exists the Hot & Cold algorithms keyword values will change, and based on the significant changes of the last request a new valid Super Glyph equation will be created. Consequently, a session can have multiple valid equations and all are taken into account when determining the final one. Super Glyphs are objects that measure events within valid parameters. In a session common denominator Super Glyphs will have a more volatile range of parameters.

Note: In all of the FIGS. using Cholti the ‘After’ or Bx accuracy levels represents the quality of existing ‘Boolean Algebra search engines [A], [B], [C], and [D] that represent 95% of the US marketing in 2008.

FIG. 15: Super Glyph Overview: this diagram (1000) represents the final resultant Super Glyph Search equation that is comprised on five pairs of Super Glyphs. From top to bottom: The (1) first pair represents the ‘end user’ satisfaction and corporate media of particular typed keywords. The second (2) pair represents the (yellow) Mulligan keywords belonging to unrelated partial environments and all the auxiliary keywords belonging to related partial environments. The third (3) pair represents valid (green) geospatial common denominator filters. The fourth (4) pair represents valid (blue) English language common denominator filters. (3) Is used to create Geodata (w, x, y, z) arrays. (4) is used to create hierarchical sets consisting of a plurality of valid Superset(i), Set(I,J) and Subset(I,J,K). The fifth (5) pair represents reasonable or certain element of the Super Glyph equation.

Note: concerning all the figures. The actual prototype uses the Superset (i), Set (i, j) and Subset (i, j, k) within the environmental domains. Thus, the system identifies optimal configuration of clusters and keyword that will be used to filter the size of the environment. Since, the Basic Glyphs are broad and the Advance Glyphs are narrow filtering patterns the order of Superset (i), Set (i, j) and Subset (i, j, k) may differ. In this case, the Basic Glyph controls the hierarchical set. How it branches into a plurality of Sets and Subsets is done by correlating both by weight, where smaller environment sizes have a greater weight and probability. Z_Price Bitmap stores exact matches and dynamic matches of Basic and Advanced Glyph search patterns. Exact matches have a higher degree of accuracy since they are a one to one relationship, whereas Dynamic matches possess a many to one. Examples:

Example #1: XCommerce finds missing gaps of information. End User's Request: “A”+“B?+“C” with the following known clusters:

1. (A+B+I) 67%, Value=4, Weight=2.67.

2. (J+B) 50%, Value=3, Weight=1.50.

3. (K+B+C) 67%, Value=5, Weight=3.33.

4. (L+C) 50%, Value=5, Weight=2.50.

5. (A+B+C) 100%, Value=5, Weight=10.0.*

In this case, the request has four known clusters 1-5 with “A”, “B”, & “C” as independent variables and “I”, “J”, “K”, & “L” are Auxiliary Variables or AV. Cholti assigns to each AV a probability. Each Cluster is measured in the scale of 1 to 5. A keyword has a value of 1-3 depending on their raw ‘Boolean Algebra’ page results. In this case cluster (A+B+C) or “American Civil War” is broad and thus has a value of 1. A cluster possesses the value of Minimum (Sum (Keyword)+1, 5). “A”, “C”, “I” and “J” has a value of 1, “B” and “K” has a value of 2, and “L” has a value of 3. Weight is calculated by multiplying the probability*value. *If a cluster is an exact match the Weight is multiplied*2. As a SWAG accuracy=Minimum (Maximum (Weight−AV, 1), 10). A denotes logical OR, + or & denotes logical AND.

Cholti creates the following hierarchical set:

Superset (i)=(A+B+C) Value=5, Weight=10 & Accuracy=10.

Set (i, 1)=(A+B+I) Value=5, Weight=6 & Accuracy=5.

Set (i, 2)=(J+B) Value=4, Weight=4 & Accuracy=3.

Set (i, 3)=(K+B+C) Value=5, Weight=8 & Accuracy=7.

Set (i, 4)=(L+C) Value=5, Weight=4 & Accuracy=3.

Set (i, 5)=(A+B+C)+J{circumflex over ( )}K{circumflex over ( )}L Value=5, Weight=10 & Accuracy=10.

Example #2 Basic Glyphs:

End User's Request: “D”+“A”+“B”+“C”

“D” is the anchor

“A+B+C” is the Superset (i)

“D” is the Set (i, j)

In this case “D+A+B+C” is the request and has four independent variables “A”, “B”, “C”, and “D”. “A”, “B” and “C” or “American Civil War” have a value of 1, and “D” or “Battlefield” has a value of 2. “D” is the strongest Keyword and is considered the Anchor. When considering the Superset (i) Cholti determines from Example #1 that “A+B+C” is an exact cluster with a value of 5. Consequently, “A+B+C” becomes the Superset (i) and “D” the Set (i, j) used as anchor.

Cholti creates the following hierarchical set:

Superset (i)=(A+B+C) Value=12, Weight=5 & Accuracy=10.

Set (i, j)=“D” Value=10, Weight=10 & Accuracy=10.

Subset (i, 1, k)=“D” & (B+C){circumflex over ( )}|{circumflex over ( )}C Value=10, Weight=7 & Accuracy=4.

Subset (i, 2, k)=“D” & (A{circumflex over ( )}C{circumflex over ( )}J) A “B” Value=10. Weight=7 & Accuracy=5.

Subset (i, 3, k)=“D” & (A{circumflex over ( )}K A B) A “C” Value=10, Weight=7 &Accuracy=6.

Subset (i, 4, k)=“D” & (A A B A L) A C Value=10. Weight=7. Accuracy=5.

Subset (i, 5, k)=“D” & (A A B{circumflex over ( )}C) Value=10. Weight=10 & Accuracy=10.

* Each Subset (i, j, k) used has a plurality of AV & DV available to further distill and shrink the size of the environment.

Example #3 Advanced Glyphs:

End User's Request: “D”+“A”+“B”+“C”+“E”

“D” is the anchor

(“A+B+C”)+[DV1]+[DV2] is the Superset (i)

“D”+[DV3]+[DV4]+Set (i, j)

“E” Geodata (w, x, y, z)

In this case “D”, “A”, “B”, “C” & “E” is the request and has five independent variables “D”, “A”, “B”, “C” & “E”. “A” & “C” have a value of 1, “B” & “D” have a value of 2. “E” or “Gettysburg” is also a Geodata (w, x, y, z) and has a value of 5. “E” is the strongest Keyword but is geospatial and is not the anchor, leaving “D” or “Battlefield” as the Anchor. When considering the Superset (i) Cholti determines from Example #1 that “A+B+C” or “American Civil War” is an exact cluster with a value of 5. Consequently, “A+B+C” becomes the Superset (i) and “D” or “Battlefield” the Set (i, j) used as anchor.

“E” is the Geodata (w, x, y, z), where w=US, x=Pennsylvania, y=a plurality of valid Zip Codes, z=Gettysburg is the center of a circle with a radius of n miles that contains all the y collection of Zip Codes. “US” or w is associated with existing toll free Area Codes of 800 and 888 et al that are national in scope. “Pennsylvania” or x associated with the LATA where the Gettysburg is located.

In example #2, Cholti measured the value of [L] left side of the brain information. In this case there is also [R] right side of the brain information. When calculating checkmate combination the system determines if a 10 exists on both sides for an optimal result, otherwise if [L] side value+[R] right side value are greater than 10 it will display the improved result.

In this case there is no optimal result with a check mate value of 20. When determining Subsets “E” & “D” are matched/merged to “X”.

Superset (i)=(A+B+C*) Value=6, Weight=6, Accuracy=10.

Set (i, j)=(A+B+C+D*) Value=8, Weight=8, Accuracy=10.

Subset (i, 1, k)=(D*+A+B) A (I{circumflex over ( )}C) Value=12, Weight=10, Accuracy=9.

Subset (i, 2, k)=(D*+(A{circumflex over ( )}C{circumflex over ( )}J)+B) Value=12, Weight=8, Accuracy=6.

Subset (i, 3, k)=(D*+(A{circumflex over ( )}K){circumflex over ( )}(B{circumflex over ( )}C) Value=12, Weight=10, Accuracy=9.

Subset (i, 4, k)=(D*& (A{circumflex over ( )}B{circumflex over ( )}L){circumflex over ( )}C Value=12. Weight=8. Accuracy=6.

Subset (i, 5, k)=(D*& (A{circumflex over ( )}B{circumflex over ( )}C) Value=12, Weight=10, Accuracy=10.

Note: The probability was modified to square root (p(x)). The Weight was rounded to its highest integer value, and it can not exceed 10. Thus 0.5 was modified to 0.7 and 0.67 to 0.8. Each Subset (i, j, k) used the Geodata (w, x, y, z) to further distill and shrink the size of the environment.

Example #4 Super Glyphs

End user's requests are identified, validated and verified into keywords. A keyword can be a ‘Zero Cluster’ and thus become a (yellow) Super Glyph. Geodata (w, x, y, z) hierarchy filters can become a (green) Super Glyphs. Exact language based clusters that are used as filters becomes (blue) a Super Glyph, corporate information becomes (red) a Super Glyph and personal information becomes a (purple) Super Glyph.

An end user is random surfing the Internet and after several requests the system has determined that a plurality of valid Advanced Glyphs exists.

1. “War Gettysburg*” ([E1]+[G1]).

2. “Civil War Gettysburg*” ([E2]+[E1]+[G1]).

3. “American Civil War Pennsylvania*” ([G2]+[E2]+[E1]+[G3]).

4. “Robert Lee” ([E3]+[E4]).

5. “General” ([E5]).

6. “General Robert Lee” ([E5]+[E3]+[E4]).

7. “Historical Battle Map USA*” ([E6]+[E7]+[E8]+[G4]).

8. “American Civil War Battle Gettysburg*” ([G2]+[E2]+[E1]+[E7]+[G1]).

From this information “USA”=[G4], “Pennsylvania”=[G3], “American”=[G2] and “Gettysburg”=[G1] are Geodata (w, x, y, z) and are represent with (green) Super Glyphs. The system has identified valid (blue) English Keywords and Clusters “War”=[E1], “Civil War”=([E2]+[E1), “American Civil War”=([G2]+[E2]+[E1]), “General”=[E5], “Historical Map”=([E6]+[E8]), “Battle Map′=([E7]+[E8]) and “Historical Battle”=([E6]+[E7]). The system identifies a plurality of purple or personal Super Glyphs such as “General Robert Lee”=[P1], “Abraham Lincoln”=[P2], “General Meade”=[P3], “General Hancock”=[P4], “General Stuart”=[P5], “General Longstreet”=[P6], “General Ulysses Grant”=[P7] and “Robert Lee”=[P8].

Geodata (green) and English language clusters (blue) consists of “Gettysburg” or [G1] is assumed to appear in all, “Pennsylvania” or [G3] in all except request 7, and “USA” or [G4] in all except requests 3 and 7. “American Civil War” or ([G2]+[E2]+[E1]) has a weight of 10, “Civil War” or ([E2]+[E1) has a weight of 5, and “War” or [E1] has a weight of 1.

Personal (purple) Super Glyph consists of “General Robert Lee” or [P1] has a weight of 10, “Robert Lee” or [P8] has a weight of 5, and “General” or [E5] has a weight of 1. “Historical Battle Map” or ([E6]+[E7]+[E8]) has a weight of 10, “Historical Battle” or ([E6]+[E7]) has a weight of 3, and “Battle Map” or ([E7]+[E8]) has a weight of 3.

“War” or [E1] is the most frequent keyword appearing in request 1, 2, 3, and 8, and “Battle” or [E7] is the hottest keyword appearing in 7 and 8. “Robert Lee” or [P8] are the coldest keyword since the last request they appear is in 6 and for the first time in 4.

XCommerce using the Hot & Algorithm parameters determines optimal Super Glyph combinations that will yield the reasonable results. XCommerce identifies “Gettysburg” or [G1] as the primary Geodata (w, x, y, z) filter. The system selects “American Civil War” or ([G2]+[E1]+[E2]) as the anchor primary cluster or Superset (i), and “General Robert Lee” or [P1] as the secondary cluster or Set (i, j) and “Historical Battle” as the tertiary cluster or Subset (i, j, k).

The common related Superset (i) environment size is 8 million W_Rank Basis, distributed in the following manner Superset (1) or “American Civil War” has (10/16)*8 million or 5 million W_Rank Basis, Superset (2) or “Civil War” has (5/16)*8 million or 2.5 million W_Rank Basis, and “War” the remainder 500,000 W_Rank Basis.

The common related Set (i, j) environment size is 800,000 or 800K W_Rank basis, distributed in the following manner Set (i, 1) “General Robert Lee” has (10/16)*800K or 500K W_Rank basis, Set (i, 2) or “Robert Lee” has (5/16)*800K or 250KW_Rank basis, and Set (i, 3) or “General” the remainder 50K W_Rank Basis.

The common related Subset (i, j, k) environment size is 80,000 or 80K W_Rank Basis, distributed in the following manner Subset (i, j, 1) “Historical Battle Maps” has (10/16)*80K or 50K W_Rank Basis, Subset (i, j, 2) or “Historical Battle” and Subset (i, j, 3) “Battle Map” both have (3/16)*80K or 15K W_Rank Basis.

The following personal Super Glyphs have the following weights:

[P1] or “General Robert Lee”=100, [P2] or “Abraham Lincoln”=70, [P3] or “General Meade”=70, [P4] or “General Hancock”=80, [P5] or “General Stuart=70, [P6] or “General Longstreet”=90, [P7] or “Ulysses Grant”=80, and [P8] or “Robert Lee”=95. The strongest keyword is “Longstreet” and “General” the lowest.

The following geospatial Super Glyphs have the following weights:

[G1] or “USA”=100, [G2] or “Pennsylvania”=90, [G1+G2] or “USA+Pennsylvania”=70, [G3] or “Gettysburg”=40, [G1+G3] or “USA+Gettysburg=35, and [G1+G2+G3] or “USA+Pennsylvania+Gettysburg”=20.

The system measures by filtering Superset (1) “American Civil War” then Set (i, 2) or Set (i, 3) “Robert Lee”|General then Subset (i, 2, 2) or Subset(i, 3, 3) “Battle Map” to derive the TOP 1000 W_Rank basis. Then the top 1000 W_Rank Basis are filtered against Geodata (w, x, y, z) filter to determine the TOP 100. Finally, the system derives the TOP 10 W_Rank Basis by comparing Super Site and personal Super Glyphs. Cholti ‘cherry picks’ the Top 1 or optimal based upon the highest Super Page weighted page rank. In this example the method was explained step by step, the computer performs all these calculation in one shot up to the TOP 100, then it executes the resource intensive algorithm of ‘triangulation deductive reasoning’ to solve for the optimal solution.

Example #5: Related Requests

1. End User's [A], [B], [C], [D], [E], [F], & [G]. [A]=American, [B]=Civil, [C]=War, [D]=Robert, [E]=Lee, [F] Battlefield, [G]=Gettysburg.

a) (A+B+C) is the Superset (i), (D+E) is the Set (i, j), [F] is the Subset (i, j, k), [G] Gettysburg is a Zero Cluster and the center to Geodata(w, x, y, z), [H]=USA, [I]=Pennsylvania, and [J]=Zip Code valid areas around Gettysburg, Pa. [A—F] consist of a left side check mate combination and [G] derives a right-side check mate combination.

b) [K]=Harrisburg (717), [L]=Altoona (814) or Williamsport (570), USA [M]=(800) or (888) toll free Area Code in ANI and are active. [K], [L] & [M] are Super Glyph filters. (717)=95, USA (800) or (888)=80, (570) or (814)=70. Not mentioned by being probable Allentown or (484), (610), (835)=60, Pittsburgh (412), (724), (878)=50, and Philadelphia (215), (267)=50. As you can see the telecommunication side of the equation can quickly become complicated, for simplicity only those that have a probability greater than 70 are used. Probabilities are assigned by distance to the center of the circle of calculation.

2. End User's request is [D], [E], [V], [W]. [D]=Robert, [E]=Lee, [V]=Union, [W] Confederates.

3. End User's request is [G], [X], [Y]. [G] is Gettysburg, [X] Historical, [Y] Maps.

Requests 1 to 3 are valid and each has a separate Superset (i), Set (i, j) and Subset (i, j, k). Cholti determines the following (i) request 1 is directly related to request 2 via [D]+[E] “Robert Lee”, (ii) request 1 is directly related to request 2 via [G] Gettysburg, and (iii) request 2 is indirectly related 3 via transitive (1->2).

The anchor Superset (1) is “Civil War”, Superset (2) is “American Civil War”, Superset (3) is “Robert Lee”, Superset (4) is “Historical Maps”. The anchor Superset (1) contains the other Superset (i) where i=2 to 4. The system assigns [F] Battlefield, [V] Union, & [W] Confederates as Set (i, j) filters. The Set (i, j) and Subsets (i, j, k) are created by the AV list of all the possible clusters of all the valid and related keyword of request 1-3. Cholti creates a Superset (i) environment of 1,000,000 W_Rank basis based on Civil War, where the “Historical Map” is the hottest filter and “American Civil War” is the coldest.

In this case [G] Gettysburg is the only hot keyword, and the message the end user gives to Cholti is to filter with the [R] side of the brain or geospatial data.

Example #6: Mulligan Requests

1. End User's Request [A], [B], [C]. [A]=Blue, [B]=Gray, [C]=Gettysburg.

2. End User's Request [X1], [Y1], [Z1]. [X1]=US, [Y1]=History, [Z1]=Atlanta.

3. End User's Request [X2], [Y2], [Z2]. [X2]=Novel=[Y2] Newt, [Z2]=Gingrich

4. End User's [D], [E], [F], [G], [H], [I], & [C]. [D]=American, [E]=Civil, [F]=War, [G]=Robert, [H]=Lee, [I] Battlefield, [C]=Gettysburg.

5. (D+E+F) is Superset (i), (G+H) is Set (i, j), [I] is Subset (i, j, k), [C] Gettysburg is a Zero Cluster and the center to Geodata (w, x, y, z), [J]=USA, [K]=Pennsylvania, [L]=Zip Code valid areas with Gettysburg, Pa. [D—I] consist of a [L] side check mate combination. [C|Z1] derives a [R] side check mate combination.

6. [M]=(717), [N]=[814] or [570] & [O]=[800] or [888] toll free Area Code in ANI and are active. Only those area codes or NPA that are reasonable or have a probability greater than seventy percent are included in this calculation.

7. [P]=Atlanta (404) or (470) & [Q]=Greater Atlanta (678) or (770) are the Area Code in ANI ranges that become inactive via mulligan. Athens (706), Rome(762), Macon (478), Valdosta (229), and Savannah (912) are probabilistic.

8. [M], [N], [0], [P], & [Q] are Super Glyph filters. [X1] is validated as Geodata ([US], X, Y, Z). [Z1] is validated as Geodata ([US], [GA], [Atlanta], Z), (Y2+Z2) is a personal purple Super Glyph (for Alternate History Gettysburg Trilogy.) and [Y1] [X2] are yellow Super Glyphs.

The system is able to match/merge requests 1 to 3 as a single request that is linked to request 4. The keywords used in the match/merge process are assigned as (yellow) unused Super Glyphs. Thus the before request 1 to 3 looks like this [A], [B], [C], [X1], [Y1], [Z1], [X2], [Y2], & [Z2]. The ‘After’ looks like this [A], [B], [C] (yellow) Super Glyphs. [X1], [Y1], [Z1], [X2], [Y2], [Z2], & Geodata ([US], [GA], [Atlanta], Z) are valid Hot & Cold Algorithm variables values used for ‘Triangulation Deductive Reasoning’ or ‘Deductive Reasoning’ as used throughout this document when solving the optimal solution.

Finally the system creates a resultant request based on 1 to 4 that are linked to a single request. [D], [E], [F] is converted to [W1], [G], [H] to [W2], and [Y2], [Z2] to [W3]. The final resultant is [W1]+[W2]+([I])|[A]|[B])+(Geodata ([US], [GA], [Atlanta], Z)+Geodata ([US], [PA], [Gettysburg], Z)|([X1]|[Y1]|[Z1]|[X2]|[W3])).

Example #7 ‘Triangulation Deductive Reasoning’ or Ex Optimal Requests

In Example #6, once the system creates the optimal Dx hierarchical set, the system is able to value and weight each Super Page and Super Site. As noted before Super Pages and Super Sites are dynamic objects that store a plurality of weights and probabilities for all the valid requests belonging to a session.

The system determines the top 100 pages from the TOP 1,000 W_Rank page results. Then it compares by paragraph, which English language or [L] side of the brain matches have the highest values, and compares to the Super Page known valid Geodata (w, x, y, z). At this time the mulligan keywords in particular ‘Zero Clusters’ are finally used in a ‘Boolean Algebra’ approach to maximize a paragraph weight using the Ex value. The system determines the weight of page to equal the maximum of (Dx Super Page weight, Ex or Paragraph value*2).

The system ‘cherry picks’ the highest value from top to bottom until the list of 100 pages is in ascending order. The highest value is the optimal result and the next nine results are also sent to the end user if the browser engine default result size is 10.

Example #8 Cholti Method Overview

In Example #1 to #6 most of the queries begin with keyword and numeric combinations that are converted into a regular expression so that the search engine using ‘Boolean Algebra’ can find the best page ranks. Cholti calculates or supplies the preprocessed Ax and Bx values to shrink the size of the environment. The system then uses the Hot & Cold Algorithm parameters and Q(x, y, z) values as filtering means to further shrink each member of the hierarchical set to have the smallest possible size.

The unrelated keywords and mulligan keywords are now used to parse and valorize paragraph by paragraph the content of each page. Then the system selects the highest valued as the optimal result. Once the optimal satisfying environment is known with the best results a mathematical equation is created that describes the hierarchical set characteristics and is then converted into Cholti style unloaded and loaded Glyphs with Q(x, y, z) and optionally with Q(w, x, y, z) values that replaces the end user's regular expression. This regular expression has the essence of the matter of Ax, Bx, Cx, and Dx samples, furthermore it has the Ex or paragraph values to solve for the end user's request. When a request has a common denominator Z_Price bitmap and a plurality of unused independent variables the preprocessed optimal environmental hierarchical set is known with the appropriate Q(w, x, y, z) values leaving the Ex calculation to be determined on the fly.

The Cholti Glyph based mathematical equation when available will significantly reduce the processing power required to respond an end user request. The equation takes into account all the requests within a session to create a final hierarchical set.

Instead of assuming erroneously that a ‘Boolean Algebra’ search always reaches with certitude the final destination. Cholti dynamically adjusts to the end user usage patterns and mimics the end user ongoing trial and error method to reach the final destination, by improving over time as better feedback is obtained.

In a session certitude is achieved each time a significant difference event is detected, unfortunately ‘Boolean Algebra’ search engines consider all events important. Cholti knows betters and uses set theory rules of association and transitivity to link related and unrelated requests, and measures probabilistically if the change between two consecutives request matters.

When the end user make a predefined ‘Z_Price Bitmap’ request that the environment has detected millions of similar request in a specific time frame, the results are always certain and up to date, since the AI Spider continuously in real time updates and improves the content of the Cholti mathematical equation optimal environment. Information that is not in real time is confounded. The greater the time the more unreliable the information becomes. In the case of Cholti real time means upon AI spider detection of significant information as it scans methodically the content of the Internet. Upon detect a new page in the environment XCommerce has the information ranked absent of having to perform the resource intensive and time consuming Master index recalculation for all page ranks.

In this example collectively the improvements mentioned over existing ‘Boolean Algebra’ means is what permits Cholti to achieve certitude.

Summary of the Invention

We've overcome these “issues” or greatly improved the search optimally by doing the following:

Generally stated end user's requests are converted into the Mayan style Glyphs that have left side and right side of the brain characteristics. The system understands that each request on its own can be optimally satisfying, and also knows that some require trial and error method. To solve this dilemma the optimizer creates Super Glyph that has weighted value for a plurality of instances within a session.

At a minimum the system needs to be a large mainframe, a parallel distributed supercomputer or preferably a MPS™ supercomputer. The system has a large data warehouse means that store a ‘CORE List’ that consists of statistics for each keyword or cluster. Consequently, at its core the technology must perform the following steps:

a) Identify each keyword interactively.

b) Validate each keyword to belong to a group.

c) Verify if a keyword will be an active participant in the process of reducing the size of the environment.

d) Estimate the Ax or ‘Before’ sample environment size from the keywords typed by the end user. Keywords typed by the end user is also known as interpreted data.

e) Determine if the end user's request is significant.

f) Create Basic Glyphs that best reflects the essence of the Ax or ‘Before’ request that will permit the creation of a hierarchical set consisting of a plurality of valid Superset (i), Set (i, j) and Subset (i, j, k).

g) Reorganize the end user's request to create Advanced Glyphs that further distills and shrinks the size of the environment using the Bx or ‘After’ request.

h) Recognize Advanced Glyph so that the server can determine if it already exist in the ‘CORE List’. If the Advanced Glyph exists in the ‘CORE List’ the optimal response is readily available and preprocessed no further calculations are required. Otherwise, the system must continue with Cx or ‘Improved’ and Dx or ‘Optimal’ samples.

i) Request the server to perform the ‘Improved’ sample by hierarchical distributing the search amongst subordinate based on ownership of the primary, secondary and tertiary keyword or cluster. The Basic and Advanced Glyphs are used to assign size parameter to each valid set of the hierarchical set.

j) Adjust dynamically the value of each keyword and cluster.

k) Exclude identified Zero Cluster keywords.

l) Emphasize through rules of association and transitivity a plurality of request that are considered to have common denominator elements and are then correlated into a partial environment. The partial environment consists of a plurality of request. The partial environment retains the characteristic of each individual request.

m) Deemphasize unrelated keywords to the last significant end user's request. This process is also known as Mulligan and is uses set theory to determine the relationship between a keyword and the last significant request.

n) Maximize keyword values by using the Hot Algorithm that measures the usage pattern and significance of a keyword in a session.

o) Minimize keyword values by using the Cold Algorithm that weights keyword irrelevancy. ‘Zero Clusters’ and unrelated keywords have a reasonable probability of hiding the optimal result. Keyword values or probabilities or numeric representations are vectors of floating-point values.

p) Correlate the plurality of partial environments into the Cx or ‘Improved Samples. This process draconically reduces the environment size using Hot & Cold Algorithm parameters and stores the essence of the matter into Super Sites.

q) Assign a corporate signature to each Super Site.

r) Pick the small Cx Sample top results of each hierarchical set to generate a collection of valid Super Pages.

s) Distill the small Cx Sample using geospatial dimensions that have exact or estimated latitude and longitude components such as Country, Region, LATA, Zip Code, IP Address and ANI.

t) Commercialize keywords by available Corporate Media resources and priorities.

u) Decipher with reasoning the ‘Dx’ or optimal sample.

v) Translate the end user's language based request into a Cholti language Super Glyph equation.

w) Respond to the client software with the optimal response. The optimal results may be identified as already existing in the preprocessed ‘CORE List’ in step h) “recognize and all calculations are preprocessed. Alternatively when derived by using steps i) “request” to v) “translate”.

x) Display to the end user the optimal request.

y) Recalculate each time the “optimal button” is clicked in the web browser and significant difference event is estimated compared to the latest Super Glyph equation or partial environment.

z) Consolidate a plurality of partial environment into a resultant environment that is contained with the valid environmental size of the hierarchical set.

These and other aspects, features, and advantages of the present invention will become more readily apparent from the attached drawings and the detailed description of the preferred embodiments, which follow.

The Internet search engine methods described herein mimic the function of the human brain by creating a language-based or left brain equation and a geospatial or right brain equation. The terms language-based and left brain are used interchangeably. The terms geospatial and right brain are used interchangeably.

While the preferred embodiments of the invention have been described above, it will be recognized and understood that various modifications can be made in the invention and the appended claims are intended to cover all such modifications which may fall within the spirit and scope of the invention. 

What is claimed is:
 1. A massive Input/Output volume search engine indexing supercomputing system to gather, analyze, and distill input information interactively, the system comprising: one or more subject matter data warehouses indexing an entire superset of potential valid keyword regular expression requests constructed during an Internet browser, and thus having readily available and pre-processed an optimal response, requiring no further calculations, bypassing the usage of existing search engine capabilities; defining keyword regular expressions as search patterns; defining the one or more subject matter data warehouses as a ‘CORE List’; one or more computers and one or more storage devices storing instructions that are operable, when executed by the one or more computers, to cause the one or more computers to perform operations comprising: gathering, analyzing, and distilling end user input information interactively from a client device and then validating the input, and deriving a list of associated keywords and common known keyword clusters within the ‘CORE List’ to yield an improved search pattern; sending the improved search pattern to the supercomputing system to analyze and distill the best responses, the highest probability response identifies the best response; scanning and validating each search pattern using the ‘CORE List’ to identify and consolidate a list of associated previously valid requests and dynamically determine a different response that is relevant to the best response; generating the output that is sent to an end-user based on the search pattern request, including a link to each of the list of associated previously valid requests a link, that upon the end-user selecting a link to an associated previously valid request, causes the ‘CORE List’ to obtain the preprocessed best responses bypassing the usage of the search engine; and displaying the best results of the search pattern, wherein the best set of results are displayed in a prioritized order.
 2. The system of claim 1, further improving the input upon searching the ‘CORE List’ and determining common denominator words using rules of association.
 3. The system of claim 1, further improving each search pattern upon determining a commercial search pattern probabilistically mapping geospatial information including continents, country, state, city, zip code, telephone number ranges and Internet Protocol Addresses.
 4. The system of claim 1 further comprising: dynamically adjusting a value of each valid request based on an end user pattern of behavior.
 5. The system of claim 1 further comprising: deemphasizing weak usage patterns and words that are determined to be unnecessary in aiding in the determination of a final destination.
 6. The system of claim 1 further comprising: emphasizing strong usage patterns and words that are determined to be necessary in aiding in the determination of a final destination.
 7. The system of claim 1, further comprising searching the ‘CORE List’ to determine a different search request selected from the list of associated valid search requests comprises: scanning and validating the best request using the ‘CORE List’ to identify and consolidate a list of associated valid search requests; and dynamically selecting a different search request that is relevant to the best response from the list of associated valid search request as the highest probability valid search request having at least one term that does not occur in the search request.
 8. The system of claim 1, further comprising searching the ‘CORE List’ to determine a different search request selected from the list of associated valid search requests comprises: scanning and weighting the list of associated valid search requests using trending and account end user's profile data of previous results; maximizing strong usage patterns and words that are determined to be necessary in aiding in the determination of a final destination; minimizing weak usage patterns and words determined to be unnecessary in aiding in the determination of a final destination; and dynamically selecting a different search request that is relevant to the best response from the list of associated valid search request as the highest weight valid search request having at least one term that does not occur in the search request.
 9. The system of claim 1, further comprising searching the ‘CORE List’ to determine a different search request selected from the list of associated valid search requests comprises: determining a respective measure of the relevancy factor for each of the valid associated search requests, the respective measure of relevancy being based on resources associated with each of the associated search request and resources identified by the associated search requests responsive to the search request; and selecting a different search request from the list of associated valid search requests as the highest respective measure of relevancy valid search request having at least one term that does not occur in the search request.
 10. A method performed on a massive Input/Output volume search engine indexing supercomputing system including gathering, analyzing, and distilling input information interactively, the method comprising: one or more subject matter data warehouses indexing an entire superset of potential valid keyword regular expression requests constructed during an Internet browser, and thus having readily available and pre-processed an optimal response, requiring no further calculations, bypassing the usage of existing search engine capabilities; defining keyword regular expressions as search patterns; defining the one or more subject matter data warehouses as a ‘CORE List’; one or more computers and one or more storage devices storing instructions that are operable, when executed by the one or more computers, to cause the one or more computers to perform operations comprising: gathering, analyzing, and distilling end user input information interactively from a client device and then validating the input, and deriving a list of associated keywords and common known keyword clusters within the ‘CORE List’ to yield an improved search pattern; sending the improved search pattern to the supercomputing system to analyze and distill the best responses, the highest probability response identifies the best response; scanning and validating each search pattern using the ‘CORE List’ to identify and consolidate a list of associated previously valid requests and dynamically determine a different response that is relevant to the best response; generating the output that is sent to an end-user based on the search pattern request, including a link to each of the list of associated previously valid requests a link, that upon the end-user selecting a link to an associated previously valid request, causes the ‘CORE List’ to obtain the preprocessed best responses bypassing the usage of the search engine; and displaying the best results of the search pattern, wherein the best set of results are displayed in a prioritized order.
 11. The method of claim 10, further improving the input upon searching the ‘CORE List’ and determining common denominator words using rules of association.
 12. The method of claim 10, further improving each search pattern upon determining a commercial search pattern probabilistically mapping geospatial information including continents, country, state, city, zip code, telephone number ranges and Internet Protocol Addresses.
 13. The method of claim 10 further comprising: dynamically adjusting a value of each valid request based on an end user pattern of behavior.
 14. The method of claim 10 further comprising: deemphasizing weak usage patterns and words that are determined to be unnecessary in aiding in the determination of a final destination.
 15. The method of claim 10 further comprising: emphasizing strong usage patterns and words that are determined to be necessary in aiding in the determination of a final destination.
 16. The method of claim 10, further comprising searching the ‘CORE List’ to determine a different search request selected from the list of associated valid search requests comprises: scanning and validating the best request using the ‘CORE List’ to identify and consolidate a list of associated valid search requests; and dynamically selecting a different search request that is relevant to the best response from the list of associated valid search request as the highest probability valid search request having at least one term that does not occur in the search request.
 17. The method of claim 10, further comprising searching the ‘CORE List’ to determine a different search request selected from the list of associated valid search requests comprises: scanning and weighting the list of associated valid search requests using trending and account end user's profile data of previous results; maximizing strong usage patterns and words that are determined to be necessary in aiding in the determination of a final destination; minimizing weak usage patterns and words determined to be unnecessary in aiding in the determination of a final destination; and dynamically selecting a different search request that is relevant to the best response from the list of associated valid search request as the highest weight valid search request having at least one term that does not occur in the search request.
 18. The method of claim 10, further comprising searching the ‘CORE List’ to determine a different search request selected from the list of associated valid search requests comprises: determining a respective measure of the relevancy factor for each of the valid associated search requests, the respective measure of relevancy being based on resources associated with each of the associated search request and resources identified by the associated search requests responsive to the search request; and selecting a different search request from the list of associated valid search requests as the highest respective measure of relevancy valid search request having at least one term that does not occur in the search request. 